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/llreve/loop_unswitching_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:51:25,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:51:25,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:51:25,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:51:25,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:51:25,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:51:25,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:51:25,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:51:25,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:51:25,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:51:25,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:51:25,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:51:25,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:51:25,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:51:25,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:51:25,849 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:51:25,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:51:25,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:51:25,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:51:25,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:51:25,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:51:25,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:51:25,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:51:25,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:51:25,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:51:25,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:51:25,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:51:25,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:51:25,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:51:25,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:51:25,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:51:25,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:51:25,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:51:25,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:51:25,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:51:25,865 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:51:25,879 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:51:25,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:51:25,880 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:51:25,880 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:51:25,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:51:25,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:51:25,881 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:51:25,881 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:51:25,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:51:25,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:51:25,882 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:51:25,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:51:25,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:51:25,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:51:25,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:51:25,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:51:25,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:51:25,888 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:51:25,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:51:25,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:51:25,888 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:51:25,890 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:51:25,890 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:51:25,934 INFO ]: Repository-Root is: /tmp [2018-06-24 20:51:25,947 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:51:25,950 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:51:25,952 INFO ]: Initializing SmtParser... [2018-06-24 20:51:25,952 INFO ]: SmtParser initialized [2018-06-24 20:51:25,957 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-24 20:51:25,959 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-24 20:51:26,049 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 unknown [2018-06-24 20:51:26,303 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop_unswitching_merged_safe.c-1.smt2 [2018-06-24 20:51:26,308 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:51:26,313 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:51:26,313 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:51:26,313 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:51:26,314 INFO ]: ChcToBoogie initialized [2018-06-24 20:51:26,317 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,382 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26 Unit [2018-06-24 20:51:26,383 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:51:26,383 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:51:26,383 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:51:26,383 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:51:26,404 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,404 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,411 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,412 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,416 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,418 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,419 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,421 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:51:26,422 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:51:26,422 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:51:26,422 INFO ]: RCFGBuilder initialized [2018-06-24 20:51:26,422 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (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-24 20:51:26,432 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:51:26,432 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:51:26,432 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:51:26,432 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:51:26,432 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:51:26,432 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-24 20:51:26,786 INFO ]: Using library mode [2018-06-24 20:51:26,786 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:26 BoogieIcfgContainer [2018-06-24 20:51:26,786 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:51:26,787 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:51:26,787 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:51:26,788 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:51:26,788 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:26" (1/1) ... [2018-06-24 20:51:26,802 INFO ]: Initial Icfg 17 locations, 24 edges [2018-06-24 20:51:26,803 INFO ]: Using Remove infeasible edges [2018-06-24 20:51:26,804 INFO ]: Using Maximize final states [2018-06-24 20:51:26,804 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:51:26,804 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:51:26,806 INFO ]: Using Remove sink states [2018-06-24 20:51:26,806 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:51:26,806 INFO ]: Using Use SBE [2018-06-24 20:51:26,834 INFO ]: SBE split 1 edges [2018-06-24 20:51:26,839 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:51:26,844 INFO ]: 0 new accepting states [2018-06-24 20:51:27,040 INFO ]: Removed 30 edges and 7 locations by large block encoding [2018-06-24 20:51:27,042 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:27,043 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-24 20:51:27,043 INFO ]: 0 new accepting states [2018-06-24 20:51:27,043 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:51:27,043 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:27,043 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:51:27,044 INFO ]: 0 new accepting states [2018-06-24 20:51:27,044 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:51:27,044 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:51:27,044 INFO ]: Encoded RCFG 8 locations, 17 edges [2018-06-24 20:51:27,044 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:51:27 BasicIcfg [2018-06-24 20:51:27,044 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:51:27,046 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:51:27,046 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:51:27,048 INFO ]: TraceAbstraction initialized [2018-06-24 20:51:27,048 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:51:26" (1/4) ... [2018-06-24 20:51:27,049 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:51:27, skipping insertion in model container [2018-06-24 20:51:27,049 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:51:26" (2/4) ... [2018-06-24 20:51:27,049 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:51:27, skipping insertion in model container [2018-06-24 20:51:27,049 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:51:26" (3/4) ... [2018-06-24 20:51:27,049 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:51:27, skipping insertion in model container [2018-06-24 20:51:27,050 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:51:27" (4/4) ... [2018-06-24 20:51:27,051 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:51:27,057 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:51:27,062 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:51:27,106 INFO ]: Using default assertion order modulation [2018-06-24 20:51:27,106 INFO ]: Interprodecural is true [2018-06-24 20:51:27,106 INFO ]: Hoare is false [2018-06-24 20:51:27,106 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:51:27,106 INFO ]: Backedges is TWOTRACK [2018-06-24 20:51:27,107 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:51:27,107 INFO ]: Difference is false [2018-06-24 20:51:27,107 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:51:27,107 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:51:27,115 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 20:51:27,123 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:51:27,123 INFO ]: Found error trace [2018-06-24 20:51:27,124 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:51:27,124 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,127 INFO ]: Analyzing trace with hash 32759301, now seen corresponding path program 1 times [2018-06-24 20:51:27,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:27,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,202 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:27,265 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:27,267 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:27,267 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:51:27,268 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:51:27,278 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:51:27,278 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:27,280 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 20:51:27,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:27,347 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-24 20:51:27,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:51:27,348 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:51:27,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:27,365 INFO ]: With dead ends: 9 [2018-06-24 20:51:27,365 INFO ]: Without dead ends: 9 [2018-06-24 20:51:27,369 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-24 20:51:27,387 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:51:27,409 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:51:27,410 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:51:27,410 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-06-24 20:51:27,411 INFO ]: Start accepts. Automaton has 9 states and 18 transitions. Word has length 5 [2018-06-24 20:51:27,412 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:27,412 INFO ]: Abstraction has 9 states and 18 transitions. [2018-06-24 20:51:27,412 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:51:27,412 INFO ]: Start isEmpty. Operand 9 states and 18 transitions. [2018-06-24 20:51:27,413 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:51:27,413 INFO ]: Found error trace [2018-06-24 20:51:27,413 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:51:27,413 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,413 INFO ]: Analyzing trace with hash 32790053, now seen corresponding path program 1 times [2018-06-24 20:51:27,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,414 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:27,414 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,422 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:27,438 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:27,438 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:27,439 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:51:27,440 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:51:27,440 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:51:27,440 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:51:27,440 INFO ]: Start difference. First operand 9 states and 18 transitions. Second operand 3 states. [2018-06-24 20:51:27,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:27,467 INFO ]: Finished difference Result 10 states and 19 transitions. [2018-06-24 20:51:27,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:51:27,468 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:51:27,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:27,468 INFO ]: With dead ends: 10 [2018-06-24 20:51:27,468 INFO ]: Without dead ends: 10 [2018-06-24 20:51:27,469 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-24 20:51:27,469 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:51:27,470 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:51:27,470 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:51:27,471 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. [2018-06-24 20:51:27,471 INFO ]: Start accepts. Automaton has 10 states and 19 transitions. Word has length 5 [2018-06-24 20:51:27,471 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:27,471 INFO ]: Abstraction has 10 states and 19 transitions. [2018-06-24 20:51:27,471 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:51:27,471 INFO ]: Start isEmpty. Operand 10 states and 19 transitions. [2018-06-24 20:51:27,471 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:27,471 INFO ]: Found error trace [2018-06-24 20:51:27,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:27,471 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,471 INFO ]: Analyzing trace with hash 1009814728, now seen corresponding path program 1 times [2018-06-24 20:51:27,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,472 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:27,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:27,542 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:27,542 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:27,542 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:27,542 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:27,542 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:27,542 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:27,542 INFO ]: Start difference. First operand 10 states and 19 transitions. Second operand 4 states. [2018-06-24 20:51:27,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:27,684 INFO ]: Finished difference Result 14 states and 26 transitions. [2018-06-24 20:51:27,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:27,685 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:27,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:27,687 INFO ]: With dead ends: 14 [2018-06-24 20:51:27,687 INFO ]: Without dead ends: 13 [2018-06-24 20:51:27,687 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:27,687 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:51:27,692 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 20:51:27,692 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:51:27,692 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-24 20:51:27,692 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 6 [2018-06-24 20:51:27,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:27,692 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-24 20:51:27,692 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:27,693 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-24 20:51:27,693 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:27,693 INFO ]: Found error trace [2018-06-24 20:51:27,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:27,693 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,693 INFO ]: Analyzing trace with hash 1009905062, now seen corresponding path program 1 times [2018-06-24 20:51:27,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,694 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:27,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,710 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:27,754 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:27,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:27,754 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:27,754 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:27,754 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:27,754 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:27,754 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 4 states. [2018-06-24 20:51:27,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:27,815 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-24 20:51:27,815 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:27,815 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:27,815 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:27,815 INFO ]: With dead ends: 16 [2018-06-24 20:51:27,815 INFO ]: Without dead ends: 15 [2018-06-24 20:51:27,816 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:27,816 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:51:27,818 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-24 20:51:27,818 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:51:27,819 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2018-06-24 20:51:27,819 INFO ]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 6 [2018-06-24 20:51:27,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:27,819 INFO ]: Abstraction has 13 states and 25 transitions. [2018-06-24 20:51:27,819 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:27,819 INFO ]: Start isEmpty. Operand 13 states and 25 transitions. [2018-06-24 20:51:27,819 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:27,819 INFO ]: Found error trace [2018-06-24 20:51:27,819 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:27,819 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:27,820 INFO ]: Analyzing trace with hash 1011661770, now seen corresponding path program 1 times [2018-06-24 20:51:27,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:27,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:27,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:27,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:27,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:27,900 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:27,900 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:27,900 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:27,900 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:27,901 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:27,901 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:27,901 INFO ]: Start difference. First operand 13 states and 25 transitions. Second operand 4 states. [2018-06-24 20:51:28,087 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:28,087 INFO ]: Finished difference Result 19 states and 37 transitions. [2018-06-24 20:51:28,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:28,087 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:28,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:28,088 INFO ]: With dead ends: 19 [2018-06-24 20:51:28,088 INFO ]: Without dead ends: 19 [2018-06-24 20:51:28,088 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:28,088 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:51:28,091 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 20:51:28,091 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:51:28,091 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2018-06-24 20:51:28,091 INFO ]: Start accepts. Automaton has 14 states and 29 transitions. Word has length 6 [2018-06-24 20:51:28,091 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:28,091 INFO ]: Abstraction has 14 states and 29 transitions. [2018-06-24 20:51:28,091 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:28,092 INFO ]: Start isEmpty. Operand 14 states and 29 transitions. [2018-06-24 20:51:28,092 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:28,092 INFO ]: Found error trace [2018-06-24 20:51:28,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:28,092 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:28,092 INFO ]: Analyzing trace with hash 1014432333, now seen corresponding path program 1 times [2018-06-24 20:51:28,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:28,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:28,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:28,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:28,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:28,105 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,171 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:28,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:28,171 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-24 20:51:28,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:28,220 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,225 INFO ]: Computing forward predicates... [2018-06-24 20:51:28,325 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:28,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:28,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 20:51:28,356 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:28,356 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:28,356 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:28,356 INFO ]: Start difference. First operand 14 states and 29 transitions. Second operand 6 states. [2018-06-24 20:51:28,396 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:28,396 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-24 20:51:28,396 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:28,396 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 20:51:28,397 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:28,397 INFO ]: With dead ends: 16 [2018-06-24 20:51:28,397 INFO ]: Without dead ends: 16 [2018-06-24 20:51:28,397 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:28,397 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:28,399 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-24 20:51:28,399 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:51:28,400 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2018-06-24 20:51:28,400 INFO ]: Start accepts. Automaton has 15 states and 30 transitions. Word has length 6 [2018-06-24 20:51:28,400 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:28,400 INFO ]: Abstraction has 15 states and 30 transitions. [2018-06-24 20:51:28,400 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:28,400 INFO ]: Start isEmpty. Operand 15 states and 30 transitions. [2018-06-24 20:51:28,400 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:28,400 INFO ]: Found error trace [2018-06-24 20:51:28,400 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:28,400 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:28,401 INFO ]: Analyzing trace with hash 1014999323, now seen corresponding path program 1 times [2018-06-24 20:51:28,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:28,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:28,401 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:28,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:28,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:28,416 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,565 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:28,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:28,565 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-24 20:51:28,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:28,612 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:28,615 INFO ]: Computing forward predicates... [2018-06-24 20:51:28,888 WARN ]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:51:28,944 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:28,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:28,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 20:51:28,963 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:28,963 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:28,963 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:28,963 INFO ]: Start difference. First operand 15 states and 30 transitions. Second operand 6 states. [2018-06-24 20:51:29,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,042 INFO ]: Finished difference Result 16 states and 31 transitions. [2018-06-24 20:51:29,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:29,042 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 20:51:29,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,043 INFO ]: With dead ends: 16 [2018-06-24 20:51:29,043 INFO ]: Without dead ends: 16 [2018-06-24 20:51:29,043 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:29,043 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:29,044 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:51:29,044 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:29,045 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 31 transitions. [2018-06-24 20:51:29,045 INFO ]: Start accepts. Automaton has 16 states and 31 transitions. Word has length 6 [2018-06-24 20:51:29,045 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,045 INFO ]: Abstraction has 16 states and 31 transitions. [2018-06-24 20:51:29,045 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:29,045 INFO ]: Start isEmpty. Operand 16 states and 31 transitions. [2018-06-24 20:51:29,045 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:29,046 INFO ]: Found error trace [2018-06-24 20:51:29,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,046 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,046 INFO ]: Analyzing trace with hash 1018126417, now seen corresponding path program 1 times [2018-06-24 20:51:29,046 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,046 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,086 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:29,086 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:29,086 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:29,086 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:29,086 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:29,086 INFO ]: Start difference. First operand 16 states and 31 transitions. Second operand 4 states. [2018-06-24 20:51:29,355 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,355 INFO ]: Finished difference Result 21 states and 41 transitions. [2018-06-24 20:51:29,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:29,355 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:29,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,356 INFO ]: With dead ends: 21 [2018-06-24 20:51:29,356 INFO ]: Without dead ends: 21 [2018-06-24 20:51:29,356 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:29,356 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:51:29,358 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 20:51:29,358 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:51:29,359 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2018-06-24 20:51:29,359 INFO ]: Start accepts. Automaton has 17 states and 35 transitions. Word has length 6 [2018-06-24 20:51:29,359 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,359 INFO ]: Abstraction has 17 states and 35 transitions. [2018-06-24 20:51:29,359 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:29,359 INFO ]: Start isEmpty. Operand 17 states and 35 transitions. [2018-06-24 20:51:29,359 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:51:29,359 INFO ]: Found error trace [2018-06-24 20:51:29,359 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,359 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,359 INFO ]: Analyzing trace with hash 1018216751, now seen corresponding path program 1 times [2018-06-24 20:51:29,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,365 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,387 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,387 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:29,387 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:29,387 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:29,387 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:29,387 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:29,387 INFO ]: Start difference. First operand 17 states and 35 transitions. Second operand 4 states. [2018-06-24 20:51:29,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,439 INFO ]: Finished difference Result 22 states and 42 transitions. [2018-06-24 20:51:29,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:29,440 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:51:29,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,440 INFO ]: With dead ends: 22 [2018-06-24 20:51:29,440 INFO ]: Without dead ends: 22 [2018-06-24 20:51:29,440 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:29,441 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:51:29,443 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-06-24 20:51:29,443 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:51:29,443 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2018-06-24 20:51:29,443 INFO ]: Start accepts. Automaton has 17 states and 35 transitions. Word has length 6 [2018-06-24 20:51:29,443 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,443 INFO ]: Abstraction has 17 states and 35 transitions. [2018-06-24 20:51:29,443 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:29,443 INFO ]: Start isEmpty. Operand 17 states and 35 transitions. [2018-06-24 20:51:29,444 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:29,444 INFO ]: Found error trace [2018-06-24 20:51:29,444 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,444 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,444 INFO ]: Analyzing trace with hash 1217228849, now seen corresponding path program 1 times [2018-06-24 20:51:29,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,588 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:51:29,588 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:29,588 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:29,588 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:29,588 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:29,588 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:29,588 INFO ]: Start difference. First operand 17 states and 35 transitions. Second operand 4 states. [2018-06-24 20:51:29,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,674 INFO ]: Finished difference Result 23 states and 44 transitions. [2018-06-24 20:51:29,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:29,677 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:29,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,678 INFO ]: With dead ends: 23 [2018-06-24 20:51:29,678 INFO ]: Without dead ends: 23 [2018-06-24 20:51:29,678 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:29,678 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:51:29,684 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-06-24 20:51:29,684 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:29,685 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2018-06-24 20:51:29,685 INFO ]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 7 [2018-06-24 20:51:29,685 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,685 INFO ]: Abstraction has 18 states and 37 transitions. [2018-06-24 20:51:29,685 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:29,685 INFO ]: Start isEmpty. Operand 18 states and 37 transitions. [2018-06-24 20:51:29,685 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:29,685 INFO ]: Found error trace [2018-06-24 20:51:29,685 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,685 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,686 INFO ]: Analyzing trace with hash 1295637800, now seen corresponding path program 1 times [2018-06-24 20:51:29,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,686 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,686 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,730 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:29,730 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-24 20:51:29,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,751 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,753 INFO ]: Computing forward predicates... [2018-06-24 20:51:29,772 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:51:29,793 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:51:29,793 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 20:51:29,793 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:51:29,793 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:51:29,793 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:51:29,794 INFO ]: Start difference. First operand 18 states and 37 transitions. Second operand 7 states. [2018-06-24 20:51:29,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:29,843 INFO ]: Finished difference Result 20 states and 39 transitions. [2018-06-24 20:51:29,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:29,843 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:51:29,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:29,844 INFO ]: With dead ends: 20 [2018-06-24 20:51:29,844 INFO ]: Without dead ends: 18 [2018-06-24 20:51:29,844 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:29,844 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:51:29,846 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:51:29,846 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:29,846 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2018-06-24 20:51:29,846 INFO ]: Start accepts. Automaton has 18 states and 36 transitions. Word has length 7 [2018-06-24 20:51:29,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:29,846 INFO ]: Abstraction has 18 states and 36 transitions. [2018-06-24 20:51:29,846 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:51:29,846 INFO ]: Start isEmpty. Operand 18 states and 36 transitions. [2018-06-24 20:51:29,847 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:29,847 INFO ]: Found error trace [2018-06-24 20:51:29,847 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:51:29,847 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:29,847 INFO ]: Analyzing trace with hash 1381525253, now seen corresponding path program 2 times [2018-06-24 20:51:29,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:29,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:29,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:29,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:29,857 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,925 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:29,925 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:29,925 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-24 20:51:29,931 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:29,961 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:29,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:29,963 INFO ]: Computing forward predicates... [2018-06-24 20:51:30,110 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,132 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:30,132 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 20:51:30,132 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:51:30,133 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:51:30,133 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:30,133 INFO ]: Start difference. First operand 18 states and 36 transitions. Second operand 8 states. [2018-06-24 20:51:30,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,173 INFO ]: Finished difference Result 21 states and 39 transitions. [2018-06-24 20:51:30,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:30,173 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 20:51:30,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,173 INFO ]: With dead ends: 21 [2018-06-24 20:51:30,173 INFO ]: Without dead ends: 17 [2018-06-24 20:51:30,173 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:30,174 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:51:30,176 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:51:30,176 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:51:30,176 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2018-06-24 20:51:30,176 INFO ]: Start accepts. Automaton has 17 states and 34 transitions. Word has length 7 [2018-06-24 20:51:30,176 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,176 INFO ]: Abstraction has 17 states and 34 transitions. [2018-06-24 20:51:30,176 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:51:30,176 INFO ]: Start isEmpty. Operand 17 states and 34 transitions. [2018-06-24 20:51:30,177 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,177 INFO ]: Found error trace [2018-06-24 20:51:30,177 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,177 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,177 INFO ]: Analyzing trace with hash 1398715621, now seen corresponding path program 2 times [2018-06-24 20:51:30,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:30,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,302 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,303 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:30,303 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-24 20:51:30,309 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:30,321 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:30,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,322 INFO ]: Computing forward predicates... [2018-06-24 20:51:30,410 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:30,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 20:51:30,430 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:51:30,430 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:51:30,430 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:30,430 INFO ]: Start difference. First operand 17 states and 34 transitions. Second operand 8 states. [2018-06-24 20:51:30,468 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,468 INFO ]: Finished difference Result 20 states and 37 transitions. [2018-06-24 20:51:30,468 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:30,468 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 20:51:30,468 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,468 INFO ]: With dead ends: 20 [2018-06-24 20:51:30,468 INFO ]: Without dead ends: 16 [2018-06-24 20:51:30,468 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:30,468 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:30,470 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:51:30,471 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:30,471 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-06-24 20:51:30,471 INFO ]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 7 [2018-06-24 20:51:30,471 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,471 INFO ]: Abstraction has 16 states and 32 transitions. [2018-06-24 20:51:30,471 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:51:30,471 INFO ]: Start isEmpty. Operand 16 states and 32 transitions. [2018-06-24 20:51:30,471 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,471 INFO ]: Found error trace [2018-06-24 20:51:30,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,472 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,472 INFO ]: Analyzing trace with hash 1472030311, now seen corresponding path program 1 times [2018-06-24 20:51:30,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:30,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,477 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,499 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,499 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:30,499 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:30,499 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:30,499 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:30,499 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:30,499 INFO ]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2018-06-24 20:51:30,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,532 INFO ]: Finished difference Result 22 states and 40 transitions. [2018-06-24 20:51:30,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:30,532 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:30,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,533 INFO ]: With dead ends: 22 [2018-06-24 20:51:30,533 INFO ]: Without dead ends: 22 [2018-06-24 20:51:30,533 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:30,533 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:51:30,535 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 20:51:30,535 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:30,535 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-06-24 20:51:30,535 INFO ]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 7 [2018-06-24 20:51:30,535 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,535 INFO ]: Abstraction has 16 states and 32 transitions. [2018-06-24 20:51:30,535 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:30,535 INFO ]: Start isEmpty. Operand 16 states and 32 transitions. [2018-06-24 20:51:30,536 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,536 INFO ]: Found error trace [2018-06-24 20:51:30,536 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,536 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,536 INFO ]: Analyzing trace with hash 1472120645, now seen corresponding path program 1 times [2018-06-24 20:51:30,536 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,537 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,542 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,554 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,554 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:30,554 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:30,554 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:30,554 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:30,554 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:30,554 INFO ]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2018-06-24 20:51:30,575 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,575 INFO ]: Finished difference Result 22 states and 37 transitions. [2018-06-24 20:51:30,575 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:30,575 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:30,575 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,576 INFO ]: With dead ends: 22 [2018-06-24 20:51:30,576 INFO ]: Without dead ends: 20 [2018-06-24 20:51:30,576 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:30,576 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:51:30,577 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-24 20:51:30,577 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:30,578 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-24 20:51:30,578 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 7 [2018-06-24 20:51:30,578 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,578 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-24 20:51:30,578 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:30,578 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-24 20:51:30,578 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,578 INFO ]: Found error trace [2018-06-24 20:51:30,578 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,578 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,578 INFO ]: Analyzing trace with hash 1474891208, now seen corresponding path program 1 times [2018-06-24 20:51:30,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,584 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,607 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:51:30,607 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:51:30,607 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:51:30,607 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:51:30,608 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:51:30,608 INFO ]: Start difference. First operand 16 states and 27 transitions. Second operand 4 states. [2018-06-24 20:51:30,653 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,654 INFO ]: Finished difference Result 22 states and 35 transitions. [2018-06-24 20:51:30,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:51:30,656 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:51:30,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,656 INFO ]: With dead ends: 22 [2018-06-24 20:51:30,656 INFO ]: Without dead ends: 22 [2018-06-24 20:51:30,657 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:51:30,657 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:51:30,658 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-24 20:51:30,659 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:51:30,659 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-24 20:51:30,659 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 7 [2018-06-24 20:51:30,659 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,659 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-24 20:51:30,659 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:51:30,659 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-24 20:51:30,659 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,659 INFO ]: Found error trace [2018-06-24 20:51:30,659 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,659 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,660 INFO ]: Analyzing trace with hash 1496041857, now seen corresponding path program 1 times [2018-06-24 20:51:30,660 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,660 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,660 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,690 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:30,690 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-24 20:51:30,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,724 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,725 INFO ]: Computing forward predicates... [2018-06-24 20:51:30,786 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,805 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:51:30,806 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-24 20:51:30,806 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:30,806 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:30,806 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:30,806 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 6 states. [2018-06-24 20:51:30,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,839 INFO ]: Finished difference Result 20 states and 31 transitions. [2018-06-24 20:51:30,840 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:30,840 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 20:51:30,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,840 INFO ]: With dead ends: 20 [2018-06-24 20:51:30,840 INFO ]: Without dead ends: 18 [2018-06-24 20:51:30,840 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:30,840 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:51:30,841 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-06-24 20:51:30,841 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:51:30,842 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2018-06-24 20:51:30,842 INFO ]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 7 [2018-06-24 20:51:30,842 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,842 INFO ]: Abstraction has 15 states and 24 transitions. [2018-06-24 20:51:30,842 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:30,842 INFO ]: Start isEmpty. Operand 15 states and 24 transitions. [2018-06-24 20:51:30,842 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:51:30,842 INFO ]: Found error trace [2018-06-24 20:51:30,842 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,842 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,842 INFO ]: Analyzing trace with hash 1498455889, now seen corresponding path program 1 times [2018-06-24 20:51:30,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,843 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,843 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,847 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,868 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:30,868 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-24 20:51:30,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:30,888 INFO ]: Computing forward predicates... [2018-06-24 20:51:30,901 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:30,921 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:51:30,921 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-06-24 20:51:30,921 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:30,921 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:30,921 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:30,921 INFO ]: Start difference. First operand 15 states and 24 transitions. Second operand 6 states. [2018-06-24 20:51:30,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:30,973 INFO ]: Finished difference Result 17 states and 26 transitions. [2018-06-24 20:51:30,973 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:51:30,973 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 20:51:30,973 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:30,973 INFO ]: With dead ends: 17 [2018-06-24 20:51:30,973 INFO ]: Without dead ends: 15 [2018-06-24 20:51:30,973 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:30,974 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:51:30,975 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-24 20:51:30,975 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:51:30,975 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-24 20:51:30,975 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 7 [2018-06-24 20:51:30,975 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:30,975 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-24 20:51:30,975 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:30,975 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-24 20:51:30,975 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:30,975 INFO ]: Found error trace [2018-06-24 20:51:30,975 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:30,975 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:30,976 INFO ]: Analyzing trace with hash -922103665, now seen corresponding path program 1 times [2018-06-24 20:51:30,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:30,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:30,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:30,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:30,984 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,120 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:51:31,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:31,120 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-24 20:51:31,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:31,138 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,140 INFO ]: Computing forward predicates... [2018-06-24 20:51:31,232 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:31,252 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-24 20:51:31,252 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:51:31,252 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:51:31,252 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:31,252 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 9 states. [2018-06-24 20:51:31,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:31,437 INFO ]: Finished difference Result 19 states and 28 transitions. [2018-06-24 20:51:31,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:51:31,437 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 20:51:31,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:31,438 INFO ]: With dead ends: 19 [2018-06-24 20:51:31,438 INFO ]: Without dead ends: 16 [2018-06-24 20:51:31,438 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:31,438 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:51:31,439 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:51:31,439 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:51:31,439 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-24 20:51:31,440 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 8 [2018-06-24 20:51:31,440 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:31,440 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-24 20:51:31,440 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:51:31,440 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-24 20:51:31,440 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:31,440 INFO ]: Found error trace [2018-06-24 20:51:31,440 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:31,440 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:31,440 INFO ]: Analyzing trace with hash 764602212, now seen corresponding path program 1 times [2018-06-24 20:51:31,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:31,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:31,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:31,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:31,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:31,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,549 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:31,549 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-24 20:51:31,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:31,569 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,570 INFO ]: Computing forward predicates... [2018-06-24 20:51:31,635 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:31,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:51:31,654 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:31,655 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:31,655 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:31,655 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 10 states. [2018-06-24 20:51:31,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:31,812 INFO ]: Finished difference Result 21 states and 31 transitions. [2018-06-24 20:51:31,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:51:31,812 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 20:51:31,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:31,812 INFO ]: With dead ends: 21 [2018-06-24 20:51:31,812 INFO ]: Without dead ends: 21 [2018-06-24 20:51:31,812 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:31,812 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:51:31,814 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-24 20:51:31,814 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:31,814 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-06-24 20:51:31,814 INFO ]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 8 [2018-06-24 20:51:31,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:31,814 INFO ]: Abstraction has 18 states and 27 transitions. [2018-06-24 20:51:31,814 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:31,814 INFO ]: Start isEmpty. Operand 18 states and 27 transitions. [2018-06-24 20:51:31,814 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:31,814 INFO ]: Found error trace [2018-06-24 20:51:31,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:31,814 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:31,815 INFO ]: Analyzing trace with hash -1612806613, now seen corresponding path program 1 times [2018-06-24 20:51:31,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:31,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:31,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:31,815 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:31,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:31,822 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,858 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,858 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:31,858 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-24 20:51:31,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:31,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:31,894 INFO ]: Computing forward predicates... [2018-06-24 20:51:31,943 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:31,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:31,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 20:51:31,962 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:51:31,962 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:51:31,962 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:31,962 INFO ]: Start difference. First operand 18 states and 27 transitions. Second operand 9 states. [2018-06-24 20:51:32,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:32,031 INFO ]: Finished difference Result 24 states and 35 transitions. [2018-06-24 20:51:32,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:51:32,032 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 20:51:32,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:32,032 INFO ]: With dead ends: 24 [2018-06-24 20:51:32,032 INFO ]: Without dead ends: 24 [2018-06-24 20:51:32,033 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:51:32,033 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:51:32,034 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-06-24 20:51:32,034 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:32,035 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-06-24 20:51:32,035 INFO ]: Start accepts. Automaton has 18 states and 27 transitions. Word has length 8 [2018-06-24 20:51:32,035 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:32,035 INFO ]: Abstraction has 18 states and 27 transitions. [2018-06-24 20:51:32,035 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:51:32,035 INFO ]: Start isEmpty. Operand 18 states and 27 transitions. [2018-06-24 20:51:32,035 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:51:32,035 INFO ]: Found error trace [2018-06-24 20:51:32,035 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:32,035 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:32,035 INFO ]: Analyzing trace with hash -1524505128, now seen corresponding path program 1 times [2018-06-24 20:51:32,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:32,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:32,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:32,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:32,199 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:32,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:32,199 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-24 20:51:32,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:32,224 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:32,226 INFO ]: Computing forward predicates... [2018-06-24 20:51:32,236 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:32,255 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:32,255 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:51:32,255 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:51:32,255 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:51:32,255 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:51:32,255 INFO ]: Start difference. First operand 18 states and 27 transitions. Second operand 6 states. [2018-06-24 20:51:32,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:32,289 INFO ]: Finished difference Result 24 states and 35 transitions. [2018-06-24 20:51:32,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:51:32,291 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:51:32,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:32,291 INFO ]: With dead ends: 24 [2018-06-24 20:51:32,291 INFO ]: Without dead ends: 24 [2018-06-24 20:51:32,291 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:32,292 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:51:32,293 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-06-24 20:51:32,293 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:51:32,293 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-06-24 20:51:32,293 INFO ]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 8 [2018-06-24 20:51:32,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:32,293 INFO ]: Abstraction has 20 states and 30 transitions. [2018-06-24 20:51:32,293 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:51:32,293 INFO ]: Start isEmpty. Operand 20 states and 30 transitions. [2018-06-24 20:51:32,294 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:32,294 INFO ]: Found error trace [2018-06-24 20:51:32,294 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:32,294 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:32,294 INFO ]: Analyzing trace with hash 747560026, now seen corresponding path program 2 times [2018-06-24 20:51:32,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:32,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:32,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,300 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:32,687 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:32,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:32,687 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:51:32,701 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:32,717 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:32,717 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:32,718 INFO ]: Computing forward predicates... [2018-06-24 20:51:32,747 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:32,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:32,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 20:51:32,768 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:51:32,768 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:51:32,769 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:32,769 INFO ]: Start difference. First operand 20 states and 30 transitions. Second operand 9 states. [2018-06-24 20:51:32,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:32,848 INFO ]: Finished difference Result 26 states and 38 transitions. [2018-06-24 20:51:32,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:51:32,848 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:51:32,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:32,849 INFO ]: With dead ends: 26 [2018-06-24 20:51:32,849 INFO ]: Without dead ends: 26 [2018-06-24 20:51:32,849 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:32,849 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:32,850 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-06-24 20:51:32,850 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:51:32,851 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-24 20:51:32,851 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 9 [2018-06-24 20:51:32,851 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:32,851 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-24 20:51:32,851 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:51:32,851 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-24 20:51:32,851 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:32,851 INFO ]: Found error trace [2018-06-24 20:51:32,851 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:32,851 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:32,851 INFO ]: Analyzing trace with hash 1482368168, now seen corresponding path program 2 times [2018-06-24 20:51:32,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:32,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:32,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:32,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:32,858 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,056 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:33,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:33,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:33,062 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:33,079 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:33,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,081 INFO ]: Computing forward predicates... [2018-06-24 20:51:33,134 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:33,153 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:33,153 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-24 20:51:33,153 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:51:33,153 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:51:33,153 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:33,153 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 8 states. [2018-06-24 20:51:33,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:33,235 INFO ]: Finished difference Result 27 states and 39 transitions. [2018-06-24 20:51:33,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:51:33,235 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:51:33,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:33,235 INFO ]: With dead ends: 27 [2018-06-24 20:51:33,235 INFO ]: Without dead ends: 27 [2018-06-24 20:51:33,236 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:51:33,236 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:51:33,237 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-06-24 20:51:33,237 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:33,237 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-06-24 20:51:33,237 INFO ]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 9 [2018-06-24 20:51:33,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:33,237 INFO ]: Abstraction has 18 states and 26 transitions. [2018-06-24 20:51:33,237 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:51:33,237 INFO ]: Start isEmpty. Operand 18 states and 26 transitions. [2018-06-24 20:51:33,238 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:33,238 INFO ]: Found error trace [2018-06-24 20:51:33,238 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:33,238 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:33,238 INFO ]: Analyzing trace with hash -2068241202, now seen corresponding path program 3 times [2018-06-24 20:51:33,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:33,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:33,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:33,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,244 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,436 INFO ]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:51:33,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:33,436 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-24 20:51:33,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:33,462 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:51:33,462 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,463 INFO ]: Computing forward predicates... [2018-06-24 20:51:33,504 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:33,523 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:33,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-06-24 20:51:33,524 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:51:33,524 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:51:33,524 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:51:33,524 INFO ]: Start difference. First operand 18 states and 26 transitions. Second operand 11 states. [2018-06-24 20:51:33,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:33,689 INFO ]: Finished difference Result 31 states and 43 transitions. [2018-06-24 20:51:33,690 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:51:33,690 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 20:51:33,690 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:33,690 INFO ]: With dead ends: 31 [2018-06-24 20:51:33,690 INFO ]: Without dead ends: 25 [2018-06-24 20:51:33,690 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:51:33,690 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:51:33,692 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-24 20:51:33,692 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:51:33,692 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-06-24 20:51:33,692 INFO ]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 9 [2018-06-24 20:51:33,692 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:33,693 INFO ]: Abstraction has 19 states and 27 transitions. [2018-06-24 20:51:33,693 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:51:33,693 INFO ]: Start isEmpty. Operand 19 states and 27 transitions. [2018-06-24 20:51:33,693 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:51:33,693 INFO ]: Found error trace [2018-06-24 20:51:33,693 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:33,693 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:33,693 INFO ]: Analyzing trace with hash -16511032, now seen corresponding path program 2 times [2018-06-24 20:51:33,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:33,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:33,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,694 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:33,694 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,699 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,793 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:33,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:33,793 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-24 20:51:33,798 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:33,813 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:33,813 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:33,815 INFO ]: Computing forward predicates... [2018-06-24 20:51:33,909 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:33,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:33,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:51:33,928 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:51:33,928 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:51:33,929 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:51:33,929 INFO ]: Start difference. First operand 19 states and 27 transitions. Second operand 9 states. [2018-06-24 20:51:33,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:33,975 INFO ]: Finished difference Result 24 states and 33 transitions. [2018-06-24 20:51:33,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:51:33,975 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:51:33,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:33,975 INFO ]: With dead ends: 24 [2018-06-24 20:51:33,975 INFO ]: Without dead ends: 21 [2018-06-24 20:51:33,975 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:33,975 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:51:33,977 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-24 20:51:33,977 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:51:33,977 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-06-24 20:51:33,977 INFO ]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 9 [2018-06-24 20:51:33,977 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:33,977 INFO ]: Abstraction has 18 states and 25 transitions. [2018-06-24 20:51:33,977 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:51:33,977 INFO ]: Start isEmpty. Operand 18 states and 25 transitions. [2018-06-24 20:51:33,978 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:51:33,978 INFO ]: Found error trace [2018-06-24 20:51:33,978 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:33,978 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:33,978 INFO ]: Analyzing trace with hash 1698032006, now seen corresponding path program 3 times [2018-06-24 20:51:33,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:33,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:33,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,978 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:33,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:33,985 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,199 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:51:34,200 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:34,200 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-24 20:51:34,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:34,225 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:51:34,225 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,227 INFO ]: Computing forward predicates... [2018-06-24 20:51:34,340 INFO ]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:51:34,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:34,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:51:34,359 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:34,359 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:34,360 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:34,360 INFO ]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2018-06-24 20:51:34,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:34,510 INFO ]: Finished difference Result 28 states and 38 transitions. [2018-06-24 20:51:34,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:51:34,510 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:51:34,510 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:34,511 INFO ]: With dead ends: 28 [2018-06-24 20:51:34,511 INFO ]: Without dead ends: 18 [2018-06-24 20:51:34,511 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:51:34,511 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:51:34,512 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-24 20:51:34,512 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:51:34,512 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-06-24 20:51:34,512 INFO ]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 10 [2018-06-24 20:51:34,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:34,512 INFO ]: Abstraction has 17 states and 23 transitions. [2018-06-24 20:51:34,512 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:34,512 INFO ]: Start isEmpty. Operand 17 states and 23 transitions. [2018-06-24 20:51:34,513 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:51:34,513 INFO ]: Found error trace [2018-06-24 20:51:34,513 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:34,513 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:34,513 INFO ]: Analyzing trace with hash -1292333046, now seen corresponding path program 4 times [2018-06-24 20:51:34,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:34,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:34,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:34,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:34,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:34,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,623 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:34,623 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:34,623 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-24 20:51:34,628 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:34,644 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:34,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,645 INFO ]: Computing forward predicates... [2018-06-24 20:51:34,700 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:34,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:34,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 20:51:34,719 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:51:34,719 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:51:34,719 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:34,719 INFO ]: Start difference. First operand 17 states and 23 transitions. Second operand 12 states. [2018-06-24 20:51:34,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:34,865 INFO ]: Finished difference Result 25 states and 33 transitions. [2018-06-24 20:51:34,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:34,865 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-24 20:51:34,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:34,866 INFO ]: With dead ends: 25 [2018-06-24 20:51:34,866 INFO ]: Without dead ends: 25 [2018-06-24 20:51:34,866 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:34,866 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:51:34,867 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-06-24 20:51:34,868 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:51:34,868 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-24 20:51:34,868 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2018-06-24 20:51:34,868 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:34,868 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-24 20:51:34,868 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:51:34,868 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-24 20:51:34,868 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:51:34,868 INFO ]: Found error trace [2018-06-24 20:51:34,868 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:34,868 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:34,869 INFO ]: Analyzing trace with hash -1059612399, now seen corresponding path program 2 times [2018-06-24 20:51:34,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:34,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:34,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:34,869 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:34,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:34,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,949 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:34,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:34,949 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-24 20:51:34,963 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:34,981 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:34,981 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:34,982 INFO ]: Computing forward predicates... [2018-06-24 20:51:35,036 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:35,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:35,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 20:51:35,055 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:51:35,055 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:51:35,055 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:35,055 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 12 states. [2018-06-24 20:51:35,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:35,169 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-24 20:51:35,169 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:35,169 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-24 20:51:35,169 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:35,169 INFO ]: With dead ends: 27 [2018-06-24 20:51:35,169 INFO ]: Without dead ends: 27 [2018-06-24 20:51:35,170 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:51:35,170 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:51:35,260 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-24 20:51:35,260 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:51:35,260 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-06-24 20:51:35,260 INFO ]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 10 [2018-06-24 20:51:35,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:35,260 INFO ]: Abstraction has 19 states and 26 transitions. [2018-06-24 20:51:35,260 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:51:35,260 INFO ]: Start isEmpty. Operand 19 states and 26 transitions. [2018-06-24 20:51:35,260 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:51:35,260 INFO ]: Found error trace [2018-06-24 20:51:35,260 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:35,260 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:35,261 INFO ]: Analyzing trace with hash -1684156273, now seen corresponding path program 3 times [2018-06-24 20:51:35,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:35,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:35,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:35,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:35,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:35,272 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:35,911 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:35,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:35,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:51:35,925 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:35,974 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:51:35,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:35,976 INFO ]: Computing forward predicates... [2018-06-24 20:51:35,992 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,023 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:36,023 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:51:36,024 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:51:36,024 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:51:36,024 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:51:36,024 INFO ]: Start difference. First operand 19 states and 26 transitions. Second operand 8 states. [2018-06-24 20:51:36,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:36,098 INFO ]: Finished difference Result 26 states and 35 transitions. [2018-06-24 20:51:36,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:36,098 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:51:36,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:36,099 INFO ]: With dead ends: 26 [2018-06-24 20:51:36,099 INFO ]: Without dead ends: 26 [2018-06-24 20:51:36,099 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:51:36,099 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:36,100 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-24 20:51:36,100 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:51:36,100 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2018-06-24 20:51:36,101 INFO ]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 10 [2018-06-24 20:51:36,101 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:36,101 INFO ]: Abstraction has 21 states and 29 transitions. [2018-06-24 20:51:36,101 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:51:36,101 INFO ]: Start isEmpty. Operand 21 states and 29 transitions. [2018-06-24 20:51:36,101 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:36,101 INFO ]: Found error trace [2018-06-24 20:51:36,101 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:36,101 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:36,101 INFO ]: Analyzing trace with hash 1285983310, now seen corresponding path program 5 times [2018-06-24 20:51:36,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:36,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:36,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,102 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:36,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,177 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:36,177 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-24 20:51:36,183 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:36,200 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:51:36,200 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,202 INFO ]: Computing forward predicates... [2018-06-24 20:51:36,228 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,247 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:36,247 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:51:36,247 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:51:36,247 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:51:36,247 INFO ]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:51:36,248 INFO ]: Start difference. First operand 21 states and 29 transitions. Second operand 11 states. [2018-06-24 20:51:36,309 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:36,309 INFO ]: Finished difference Result 29 states and 39 transitions. [2018-06-24 20:51:36,309 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:36,310 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 20:51:36,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:36,310 INFO ]: With dead ends: 29 [2018-06-24 20:51:36,310 INFO ]: Without dead ends: 29 [2018-06-24 20:51:36,310 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:36,310 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:51:36,311 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-06-24 20:51:36,311 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:51:36,311 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-24 20:51:36,311 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 11 [2018-06-24 20:51:36,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:36,311 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-24 20:51:36,311 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:51:36,311 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-24 20:51:36,312 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:36,312 INFO ]: Found error trace [2018-06-24 20:51:36,312 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:36,312 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:36,312 INFO ]: Analyzing trace with hash -1408724760, now seen corresponding path program 6 times [2018-06-24 20:51:36,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:36,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:36,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:36,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,318 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,475 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:36,475 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-24 20:51:36,480 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:36,498 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:51:36,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,500 INFO ]: Computing forward predicates... [2018-06-24 20:51:36,544 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,563 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:36,563 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:51:36,563 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:51:36,563 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:51:36,563 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:36,563 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 12 states. [2018-06-24 20:51:36,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:36,616 INFO ]: Finished difference Result 30 states and 39 transitions. [2018-06-24 20:51:36,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:36,617 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:51:36,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:36,617 INFO ]: With dead ends: 30 [2018-06-24 20:51:36,617 INFO ]: Without dead ends: 26 [2018-06-24 20:51:36,617 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:36,618 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:36,619 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-06-24 20:51:36,619 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:51:36,619 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-06-24 20:51:36,619 INFO ]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 11 [2018-06-24 20:51:36,619 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:36,619 INFO ]: Abstraction has 21 states and 28 transitions. [2018-06-24 20:51:36,619 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:51:36,619 INFO ]: Start isEmpty. Operand 21 states and 28 transitions. [2018-06-24 20:51:36,620 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:36,620 INFO ]: Found error trace [2018-06-24 20:51:36,620 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:36,620 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:36,620 INFO ]: Analyzing trace with hash -1841551192, now seen corresponding path program 4 times [2018-06-24 20:51:36,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:36,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:36,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:36,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,686 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:36,686 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-24 20:51:36,692 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:36,711 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:36,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,712 INFO ]: Computing forward predicates... [2018-06-24 20:51:36,765 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,783 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:36,783 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:51:36,783 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:51:36,783 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:51:36,783 INFO ]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:51:36,783 INFO ]: Start difference. First operand 21 states and 28 transitions. Second operand 11 states. [2018-06-24 20:51:36,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:36,907 INFO ]: Finished difference Result 26 states and 34 transitions. [2018-06-24 20:51:36,907 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:36,907 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 20:51:36,907 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:36,908 INFO ]: With dead ends: 26 [2018-06-24 20:51:36,908 INFO ]: Without dead ends: 26 [2018-06-24 20:51:36,908 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:36,908 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:36,909 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-06-24 20:51:36,909 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:51:36,909 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-24 20:51:36,909 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2018-06-24 20:51:36,909 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:36,909 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-24 20:51:36,909 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:51:36,909 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-24 20:51:36,910 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:51:36,910 INFO ]: Found error trace [2018-06-24 20:51:36,910 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:36,910 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:36,910 INFO ]: Analyzing trace with hash -670729231, now seen corresponding path program 5 times [2018-06-24 20:51:36,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:36,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:36,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:36,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:36,916 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:36,966 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:36,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:36,966 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-24 20:51:36,971 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:37,003 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:51:37,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:37,005 INFO ]: Computing forward predicates... [2018-06-24 20:51:37,062 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:37,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:37,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:51:37,085 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:51:37,085 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:51:37,085 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:37,085 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 12 states. [2018-06-24 20:51:37,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:37,146 INFO ]: Finished difference Result 26 states and 33 transitions. [2018-06-24 20:51:37,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:51:37,147 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:51:37,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:37,147 INFO ]: With dead ends: 26 [2018-06-24 20:51:37,147 INFO ]: Without dead ends: 22 [2018-06-24 20:51:37,147 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:37,147 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:51:37,148 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:51:37,148 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:51:37,149 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-24 20:51:37,149 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2018-06-24 20:51:37,149 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:37,149 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-24 20:51:37,149 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:51:37,149 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-24 20:51:37,149 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:51:37,149 INFO ]: Found error trace [2018-06-24 20:51:37,149 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:37,149 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:37,150 INFO ]: Analyzing trace with hash 1209670948, now seen corresponding path program 7 times [2018-06-24 20:51:37,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:37,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:37,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,150 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:37,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:37,470 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:37,470 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:37,470 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-24 20:51:37,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:37,493 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:37,495 INFO ]: Computing forward predicates... [2018-06-24 20:51:37,605 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:37,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:37,632 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-06-24 20:51:37,632 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:51:37,632 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:51:37,632 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:51:37,632 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 15 states. [2018-06-24 20:51:37,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:37,877 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-24 20:51:37,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:37,878 INFO ]: Start accepts. Automaton has 15 states. Word has length 12 [2018-06-24 20:51:37,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:37,878 INFO ]: With dead ends: 31 [2018-06-24 20:51:37,878 INFO ]: Without dead ends: 31 [2018-06-24 20:51:37,878 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:37,878 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:51:37,880 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-24 20:51:37,880 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:51:37,880 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-24 20:51:37,880 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-06-24 20:51:37,880 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:37,880 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-24 20:51:37,880 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:51:37,880 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-24 20:51:37,880 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:51:37,880 INFO ]: Found error trace [2018-06-24 20:51:37,881 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:37,881 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:37,881 INFO ]: Analyzing trace with hash 1515913323, now seen corresponding path program 3 times [2018-06-24 20:51:37,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:37,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:37,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:37,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:37,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:38,133 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:38,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:38,133 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-24 20:51:38,139 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:38,158 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:51:38,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:38,160 INFO ]: Computing forward predicates... [2018-06-24 20:51:38,238 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:38,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:38,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-06-24 20:51:38,256 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:51:38,256 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:51:38,256 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:51:38,256 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 15 states. [2018-06-24 20:51:38,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:38,391 INFO ]: Finished difference Result 33 states and 42 transitions. [2018-06-24 20:51:38,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:38,391 INFO ]: Start accepts. Automaton has 15 states. Word has length 12 [2018-06-24 20:51:38,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:38,391 INFO ]: With dead ends: 33 [2018-06-24 20:51:38,391 INFO ]: Without dead ends: 33 [2018-06-24 20:51:38,391 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:38,391 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:51:38,392 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-06-24 20:51:38,392 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:51:38,392 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-24 20:51:38,392 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 12 [2018-06-24 20:51:38,392 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:38,392 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-24 20:51:38,392 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:51:38,392 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-24 20:51:38,393 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:51:38,393 INFO ]: Found error trace [2018-06-24 20:51:38,393 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:38,393 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:38,393 INFO ]: Analyzing trace with hash -1255004424, now seen corresponding path program 6 times [2018-06-24 20:51:38,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:38,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:38,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:38,393 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:38,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:38,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:38,557 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:38,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:38,557 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-24 20:51:38,562 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:38,582 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:51:38,582 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:38,584 INFO ]: Computing forward predicates... [2018-06-24 20:51:38,615 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:38,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:38,640 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:51:38,640 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:51:38,640 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:51:38,640 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:51:38,641 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 10 states. [2018-06-24 20:51:39,104 WARN ]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:51:39,408 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 20:51:39,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:39,409 INFO ]: Finished difference Result 31 states and 40 transitions. [2018-06-24 20:51:39,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:39,409 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:51:39,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:39,409 INFO ]: With dead ends: 31 [2018-06-24 20:51:39,409 INFO ]: Without dead ends: 31 [2018-06-24 20:51:39,409 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:39,409 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:51:39,410 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-24 20:51:39,410 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:51:39,411 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-24 20:51:39,411 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 12 [2018-06-24 20:51:39,411 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:39,411 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-24 20:51:39,411 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:51:39,411 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-24 20:51:39,411 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:39,411 INFO ]: Found error trace [2018-06-24 20:51:39,411 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:39,412 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:39,412 INFO ]: Analyzing trace with hash 775559272, now seen corresponding path program 8 times [2018-06-24 20:51:39,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:39,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:39,416 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:39,423 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:39,714 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:39,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:39,714 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-24 20:51:39,720 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:39,740 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:39,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:39,741 INFO ]: Computing forward predicates... [2018-06-24 20:51:39,784 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:39,803 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:39,803 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:51:39,803 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:51:39,803 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:51:39,803 INFO ]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:39,803 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 14 states. [2018-06-24 20:51:39,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:39,914 INFO ]: Finished difference Result 35 states and 45 transitions. [2018-06-24 20:51:39,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:51:39,916 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-24 20:51:39,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:39,916 INFO ]: With dead ends: 35 [2018-06-24 20:51:39,916 INFO ]: Without dead ends: 35 [2018-06-24 20:51:39,916 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:39,916 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:51:39,917 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-06-24 20:51:39,918 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:51:39,918 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-24 20:51:39,918 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2018-06-24 20:51:39,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:39,918 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-24 20:51:39,918 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:51:39,918 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-24 20:51:39,918 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:39,918 INFO ]: Found error trace [2018-06-24 20:51:39,918 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:39,918 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:39,918 INFO ]: Analyzing trace with hash -1156012274, now seen corresponding path program 9 times [2018-06-24 20:51:39,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:39,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:39,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:39,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:39,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:39,927 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,006 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:40,006 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-24 20:51:40,011 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:40,031 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:51:40,031 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,033 INFO ]: Computing forward predicates... [2018-06-24 20:51:40,124 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,143 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:40,143 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:51:40,143 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:51:40,143 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:51:40,143 INFO ]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:51:40,143 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 15 states. [2018-06-24 20:51:40,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:40,211 INFO ]: Finished difference Result 36 states and 45 transitions. [2018-06-24 20:51:40,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:40,211 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:51:40,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:40,211 INFO ]: With dead ends: 36 [2018-06-24 20:51:40,211 INFO ]: Without dead ends: 31 [2018-06-24 20:51:40,212 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:51:40,212 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:51:40,212 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-24 20:51:40,212 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:51:40,212 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-06-24 20:51:40,212 INFO ]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2018-06-24 20:51:40,213 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:40,213 INFO ]: Abstraction has 25 states and 32 transitions. [2018-06-24 20:51:40,213 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:51:40,213 INFO ]: Start isEmpty. Operand 25 states and 32 transitions. [2018-06-24 20:51:40,213 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:40,213 INFO ]: Found error trace [2018-06-24 20:51:40,213 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:40,213 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:40,213 INFO ]: Analyzing trace with hash 2107301073, now seen corresponding path program 7 times [2018-06-24 20:51:40,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:40,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:40,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,213 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:40,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,285 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:40,285 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-24 20:51:40,290 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:40,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,312 INFO ]: Computing forward predicates... [2018-06-24 20:51:40,372 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:40,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:51:40,392 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:51:40,392 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:51:40,392 INFO ]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:40,392 INFO ]: Start difference. First operand 25 states and 32 transitions. Second operand 14 states. [2018-06-24 20:51:40,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:40,523 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-24 20:51:40,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:51:40,524 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-24 20:51:40,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:40,524 INFO ]: With dead ends: 31 [2018-06-24 20:51:40,524 INFO ]: Without dead ends: 31 [2018-06-24 20:51:40,524 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:40,524 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:51:40,525 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-06-24 20:51:40,525 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:51:40,525 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-06-24 20:51:40,525 INFO ]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2018-06-24 20:51:40,525 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:40,525 INFO ]: Abstraction has 24 states and 30 transitions. [2018-06-24 20:51:40,526 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:51:40,526 INFO ]: Start isEmpty. Operand 24 states and 30 transitions. [2018-06-24 20:51:40,526 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:51:40,526 INFO ]: Found error trace [2018-06-24 20:51:40,526 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:40,526 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:40,526 INFO ]: Analyzing trace with hash -251923800, now seen corresponding path program 8 times [2018-06-24 20:51:40,526 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:40,526 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:40,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:40,527 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,532 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,628 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,628 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:40,628 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-24 20:51:40,633 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:40,654 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:40,655 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:40,656 INFO ]: Computing forward predicates... [2018-06-24 20:51:40,712 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:40,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:40,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:51:40,731 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:51:40,731 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:51:40,731 INFO ]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:51:40,731 INFO ]: Start difference. First operand 24 states and 30 transitions. Second operand 15 states. [2018-06-24 20:51:40,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:40,797 INFO ]: Finished difference Result 31 states and 38 transitions. [2018-06-24 20:51:40,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:51:40,798 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:51:40,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:40,798 INFO ]: With dead ends: 31 [2018-06-24 20:51:40,798 INFO ]: Without dead ends: 26 [2018-06-24 20:51:40,799 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:51:40,799 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:51:40,799 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-24 20:51:40,799 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:51:40,800 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-06-24 20:51:40,800 INFO ]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 13 [2018-06-24 20:51:40,800 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:40,800 INFO ]: Abstraction has 25 states and 31 transitions. [2018-06-24 20:51:40,800 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:51:40,800 INFO ]: Start isEmpty. Operand 25 states and 31 transitions. [2018-06-24 20:51:40,800 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:51:40,800 INFO ]: Found error trace [2018-06-24 20:51:40,800 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:40,800 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:40,800 INFO ]: Analyzing trace with hash -1728572342, now seen corresponding path program 10 times [2018-06-24 20:51:40,800 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:40,800 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:40,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,801 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:40,801 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:40,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:41,166 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:41,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:41,166 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-24 20:51:41,172 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:41,221 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:41,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:41,224 INFO ]: Computing forward predicates... [2018-06-24 20:51:41,496 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:41,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:41,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-24 20:51:41,515 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:51:41,516 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:51:41,516 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:41,516 INFO ]: Start difference. First operand 25 states and 31 transitions. Second operand 18 states. [2018-06-24 20:51:41,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:41,911 INFO ]: Finished difference Result 37 states and 45 transitions. [2018-06-24 20:51:41,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:51:41,911 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-24 20:51:41,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:41,911 INFO ]: With dead ends: 37 [2018-06-24 20:51:41,911 INFO ]: Without dead ends: 37 [2018-06-24 20:51:41,912 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:51:41,912 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:51:41,913 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-06-24 20:51:41,913 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:51:41,913 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-24 20:51:41,913 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-06-24 20:51:41,913 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:41,913 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-24 20:51:41,913 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:51:41,913 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-24 20:51:41,913 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:51:41,913 INFO ]: Found error trace [2018-06-24 20:51:41,913 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:41,913 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:41,913 INFO ]: Analyzing trace with hash 512573905, now seen corresponding path program 4 times [2018-06-24 20:51:41,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:41,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:41,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:41,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:41,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:41,921 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:42,182 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:42,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:42,182 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) [2018-06-24 20:51:42,196 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:42,222 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:42,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:42,224 INFO ]: Computing forward predicates... [2018-06-24 20:51:42,294 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:42,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:42,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-24 20:51:42,317 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:51:42,317 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:51:42,317 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:42,317 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 18 states. [2018-06-24 20:51:42,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:42,453 INFO ]: Finished difference Result 39 states and 48 transitions. [2018-06-24 20:51:42,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:51:42,453 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-24 20:51:42,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:42,454 INFO ]: With dead ends: 39 [2018-06-24 20:51:42,454 INFO ]: Without dead ends: 39 [2018-06-24 20:51:42,454 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:51:42,454 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:51:42,455 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 27. [2018-06-24 20:51:42,455 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:51:42,455 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-06-24 20:51:42,455 INFO ]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 14 [2018-06-24 20:51:42,455 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:42,455 INFO ]: Abstraction has 27 states and 34 transitions. [2018-06-24 20:51:42,455 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:51:42,456 INFO ]: Start isEmpty. Operand 27 states and 34 transitions. [2018-06-24 20:51:42,456 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:51:42,456 INFO ]: Found error trace [2018-06-24 20:51:42,456 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:42,456 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:42,456 INFO ]: Analyzing trace with hash 900331503, now seen corresponding path program 9 times [2018-06-24 20:51:42,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:42,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:42,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:42,456 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:42,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:42,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:42,620 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:42,620 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:42,620 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-24 20:51:42,625 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:42,650 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:51:42,650 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:42,652 INFO ]: Computing forward predicates... [2018-06-24 20:51:42,671 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:42,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:42,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:51:42,690 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:51:42,690 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:51:42,690 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:51:42,690 INFO ]: Start difference. First operand 27 states and 34 transitions. Second operand 12 states. [2018-06-24 20:51:42,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:42,821 INFO ]: Finished difference Result 36 states and 45 transitions. [2018-06-24 20:51:42,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:51:42,821 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:51:42,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:42,821 INFO ]: With dead ends: 36 [2018-06-24 20:51:42,821 INFO ]: Without dead ends: 36 [2018-06-24 20:51:42,821 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:51:42,821 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:42,823 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-06-24 20:51:42,823 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:51:42,823 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-24 20:51:42,823 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2018-06-24 20:51:42,823 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:42,823 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-24 20:51:42,823 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:51:42,823 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-24 20:51:42,823 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:51:42,823 INFO ]: Found error trace [2018-06-24 20:51:42,823 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:42,823 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:42,823 INFO ]: Analyzing trace with hash 1996902030, now seen corresponding path program 11 times [2018-06-24 20:51:42,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:42,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:42,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:42,824 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:42,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:42,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:43,121 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:43,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:43,121 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-24 20:51:43,126 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:43,150 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:51:43,150 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:43,152 INFO ]: Computing forward predicates... [2018-06-24 20:51:43,193 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:43,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:43,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 20:51:43,212 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:51:43,212 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:51:43,212 INFO ]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:51:43,212 INFO ]: Start difference. First operand 29 states and 37 transitions. Second operand 17 states. [2018-06-24 20:51:43,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:43,340 INFO ]: Finished difference Result 41 states and 51 transitions. [2018-06-24 20:51:43,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:43,340 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 20:51:43,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:43,340 INFO ]: With dead ends: 41 [2018-06-24 20:51:43,340 INFO ]: Without dead ends: 41 [2018-06-24 20:51:43,340 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:51:43,340 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:51:43,341 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-06-24 20:51:43,341 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:51:43,341 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-06-24 20:51:43,342 INFO ]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2018-06-24 20:51:43,342 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:43,342 INFO ]: Abstraction has 28 states and 35 transitions. [2018-06-24 20:51:43,342 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:51:43,342 INFO ]: Start isEmpty. Operand 28 states and 35 transitions. [2018-06-24 20:51:43,342 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:51:43,342 INFO ]: Found error trace [2018-06-24 20:51:43,342 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:43,342 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:43,342 INFO ]: Analyzing trace with hash -2047241048, now seen corresponding path program 12 times [2018-06-24 20:51:43,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:43,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:43,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:43,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:43,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:43,350 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:43,646 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:43,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:43,646 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-24 20:51:43,652 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:43,684 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:51:43,684 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:43,686 INFO ]: Computing forward predicates... [2018-06-24 20:51:43,748 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:43,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:43,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:51:43,767 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:51:43,767 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:51:43,767 INFO ]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:43,767 INFO ]: Start difference. First operand 28 states and 35 transitions. Second operand 18 states. [2018-06-24 20:51:43,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:43,859 INFO ]: Finished difference Result 42 states and 51 transitions. [2018-06-24 20:51:43,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:51:43,860 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-24 20:51:43,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:43,860 INFO ]: With dead ends: 42 [2018-06-24 20:51:43,860 INFO ]: Without dead ends: 36 [2018-06-24 20:51:43,861 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:43,861 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:43,861 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-06-24 20:51:43,861 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:51:43,862 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-06-24 20:51:43,862 INFO ]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2018-06-24 20:51:43,862 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:43,862 INFO ]: Abstraction has 29 states and 36 transitions. [2018-06-24 20:51:43,862 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:51:43,862 INFO ]: Start isEmpty. Operand 29 states and 36 transitions. [2018-06-24 20:51:43,862 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:51:43,862 INFO ]: Found error trace [2018-06-24 20:51:43,862 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:43,862 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:43,862 INFO ]: Analyzing trace with hash -2034459768, now seen corresponding path program 10 times [2018-06-24 20:51:43,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:43,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:43,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:43,863 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:43,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:43,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:44,158 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:44,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:44,158 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-24 20:51:44,163 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:44,186 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:44,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:44,187 INFO ]: Computing forward predicates... [2018-06-24 20:51:44,273 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:44,293 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:44,293 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 20:51:44,293 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:51:44,293 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:51:44,293 INFO ]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:51:44,293 INFO ]: Start difference. First operand 29 states and 36 transitions. Second operand 17 states. [2018-06-24 20:51:44,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:44,416 INFO ]: Finished difference Result 36 states and 44 transitions. [2018-06-24 20:51:44,416 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:44,416 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 20:51:44,416 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:44,416 INFO ]: With dead ends: 36 [2018-06-24 20:51:44,416 INFO ]: Without dead ends: 36 [2018-06-24 20:51:44,417 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:51:44,417 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:44,418 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-24 20:51:44,418 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:51:44,418 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-06-24 20:51:44,418 INFO ]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 15 [2018-06-24 20:51:44,418 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:44,418 INFO ]: Abstraction has 28 states and 34 transitions. [2018-06-24 20:51:44,418 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:51:44,418 INFO ]: Start isEmpty. Operand 28 states and 34 transitions. [2018-06-24 20:51:44,418 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:51:44,418 INFO ]: Found error trace [2018-06-24 20:51:44,418 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:44,418 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:44,418 INFO ]: Analyzing trace with hash 2138980497, now seen corresponding path program 11 times [2018-06-24 20:51:44,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:44,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:44,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:44,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:44,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:44,424 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:44,529 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:44,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:44,529 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-24 20:51:44,536 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:44,575 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:51:44,575 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:44,576 INFO ]: Computing forward predicates... [2018-06-24 20:51:44,634 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:44,652 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:44,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:51:44,653 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:51:44,653 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:51:44,653 INFO ]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:44,653 INFO ]: Start difference. First operand 28 states and 34 transitions. Second operand 18 states. [2018-06-24 20:51:44,751 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:44,751 INFO ]: Finished difference Result 36 states and 43 transitions. [2018-06-24 20:51:44,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:51:44,751 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-24 20:51:44,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:44,751 INFO ]: With dead ends: 36 [2018-06-24 20:51:44,751 INFO ]: Without dead ends: 30 [2018-06-24 20:51:44,751 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:44,751 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:51:44,752 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-06-24 20:51:44,752 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:51:44,753 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-06-24 20:51:44,753 INFO ]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 15 [2018-06-24 20:51:44,753 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:44,753 INFO ]: Abstraction has 29 states and 35 transitions. [2018-06-24 20:51:44,753 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:51:44,753 INFO ]: Start isEmpty. Operand 29 states and 35 transitions. [2018-06-24 20:51:44,753 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:51:44,753 INFO ]: Found error trace [2018-06-24 20:51:44,753 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:44,753 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:44,753 INFO ]: Analyzing trace with hash 1773314788, now seen corresponding path program 13 times [2018-06-24 20:51:44,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:44,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:44,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:44,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:44,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:44,760 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:45,215 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:45,215 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:45,215 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-24 20:51:45,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:45,244 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:45,247 INFO ]: Computing forward predicates... [2018-06-24 20:51:45,561 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:45,593 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:45,593 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-06-24 20:51:45,593 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:51:45,593 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:51:45,593 INFO ]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:45,594 INFO ]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2018-06-24 20:51:45,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:45,922 INFO ]: Finished difference Result 43 states and 51 transitions. [2018-06-24 20:51:45,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:45,922 INFO ]: Start accepts. Automaton has 21 states. Word has length 16 [2018-06-24 20:51:45,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:45,923 INFO ]: With dead ends: 43 [2018-06-24 20:51:45,923 INFO ]: Without dead ends: 43 [2018-06-24 20:51:45,923 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:51:45,923 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:51:45,924 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-06-24 20:51:45,924 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:51:45,924 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-06-24 20:51:45,924 INFO ]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 16 [2018-06-24 20:51:45,924 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:45,924 INFO ]: Abstraction has 35 states and 42 transitions. [2018-06-24 20:51:45,924 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:51:45,924 INFO ]: Start isEmpty. Operand 35 states and 42 transitions. [2018-06-24 20:51:45,924 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:51:45,924 INFO ]: Found error trace [2018-06-24 20:51:45,924 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:45,924 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:45,924 INFO ]: Analyzing trace with hash -558724437, now seen corresponding path program 5 times [2018-06-24 20:51:45,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:45,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:45,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:45,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:45,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:45,931 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:46,130 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:46,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:46,130 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-24 20:51:46,136 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:46,217 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:51:46,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:46,220 INFO ]: Computing forward predicates... [2018-06-24 20:51:46,324 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:46,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:46,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-06-24 20:51:46,343 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:51:46,343 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:51:46,343 INFO ]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:46,343 INFO ]: Start difference. First operand 35 states and 42 transitions. Second operand 21 states. [2018-06-24 20:51:46,523 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:46,523 INFO ]: Finished difference Result 45 states and 54 transitions. [2018-06-24 20:51:46,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:46,523 INFO ]: Start accepts. Automaton has 21 states. Word has length 16 [2018-06-24 20:51:46,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:46,523 INFO ]: With dead ends: 45 [2018-06-24 20:51:46,523 INFO ]: Without dead ends: 45 [2018-06-24 20:51:46,523 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:51:46,523 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:51:46,524 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-24 20:51:46,524 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:51:46,525 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-06-24 20:51:46,525 INFO ]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 16 [2018-06-24 20:51:46,525 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:46,525 INFO ]: Abstraction has 31 states and 38 transitions. [2018-06-24 20:51:46,525 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:51:46,525 INFO ]: Start isEmpty. Operand 31 states and 38 transitions. [2018-06-24 20:51:46,525 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:51:46,525 INFO ]: Found error trace [2018-06-24 20:51:46,525 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:46,525 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:46,525 INFO ]: Analyzing trace with hash 1354764312, now seen corresponding path program 12 times [2018-06-24 20:51:46,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:46,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:46,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:46,526 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:46,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:46,533 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:46,695 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:46,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:46,695 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-24 20:51:46,701 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:46,728 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:51:46,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:46,730 INFO ]: Computing forward predicates... [2018-06-24 20:51:46,760 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:46,779 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:46,779 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:51:46,779 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:51:46,779 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:51:46,779 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:51:46,779 INFO ]: Start difference. First operand 31 states and 38 transitions. Second operand 14 states. [2018-06-24 20:51:46,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:46,955 INFO ]: Finished difference Result 41 states and 50 transitions. [2018-06-24 20:51:46,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:46,955 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:51:46,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:46,955 INFO ]: With dead ends: 41 [2018-06-24 20:51:46,955 INFO ]: Without dead ends: 41 [2018-06-24 20:51:46,955 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:51:46,955 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:51:46,956 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-24 20:51:46,956 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:51:46,956 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-06-24 20:51:46,956 INFO ]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 16 [2018-06-24 20:51:46,957 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:46,957 INFO ]: Abstraction has 33 states and 41 transitions. [2018-06-24 20:51:46,957 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:51:46,957 INFO ]: Start isEmpty. Operand 33 states and 41 transitions. [2018-06-24 20:51:46,957 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:51:46,957 INFO ]: Found error trace [2018-06-24 20:51:46,957 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:46,957 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:46,957 INFO ]: Analyzing trace with hash -48538584, now seen corresponding path program 14 times [2018-06-24 20:51:46,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:46,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:46,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:46,957 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:46,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:46,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,232 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:47,233 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-24 20:51:47,242 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:47,272 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:47,272 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:47,274 INFO ]: Computing forward predicates... [2018-06-24 20:51:47,325 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:47,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:47,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-24 20:51:47,344 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:51:47,344 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:51:47,344 INFO ]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:51:47,344 INFO ]: Start difference. First operand 33 states and 41 transitions. Second operand 20 states. [2018-06-24 20:51:47,519 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:47,519 INFO ]: Finished difference Result 47 states and 57 transitions. [2018-06-24 20:51:47,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:51:47,520 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-24 20:51:47,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:47,520 INFO ]: With dead ends: 47 [2018-06-24 20:51:47,520 INFO ]: Without dead ends: 47 [2018-06-24 20:51:47,520 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:51:47,520 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:51:47,521 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-06-24 20:51:47,521 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:51:47,522 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-06-24 20:51:47,522 INFO ]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2018-06-24 20:51:47,522 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:47,522 INFO ]: Abstraction has 32 states and 39 transitions. [2018-06-24 20:51:47,522 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:51:47,522 INFO ]: Start isEmpty. Operand 32 states and 39 transitions. [2018-06-24 20:51:47,522 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:51:47,522 INFO ]: Found error trace [2018-06-24 20:51:47,522 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:47,522 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:47,522 INFO ]: Analyzing trace with hash -862922418, now seen corresponding path program 15 times [2018-06-24 20:51:47,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:47,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:47,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,523 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:47,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:47,528 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,039 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:48,039 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-24 20:51:48,045 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:48,073 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:51:48,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:48,075 INFO ]: Computing forward predicates... [2018-06-24 20:51:48,679 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:48,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:48,700 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:51:48,700 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:51:48,700 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:51:48,700 INFO ]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:48,701 INFO ]: Start difference. First operand 32 states and 39 transitions. Second operand 21 states. [2018-06-24 20:51:48,901 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:48,901 INFO ]: Finished difference Result 48 states and 57 transitions. [2018-06-24 20:51:48,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:48,902 INFO ]: Start accepts. Automaton has 21 states. Word has length 17 [2018-06-24 20:51:48,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:48,902 INFO ]: With dead ends: 48 [2018-06-24 20:51:48,902 INFO ]: Without dead ends: 41 [2018-06-24 20:51:48,902 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:51:48,902 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:51:48,903 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-24 20:51:48,903 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:51:48,904 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-24 20:51:48,904 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 17 [2018-06-24 20:51:48,904 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:48,904 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-24 20:51:48,904 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:51:48,904 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-24 20:51:48,904 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:51:48,904 INFO ]: Found error trace [2018-06-24 20:51:48,904 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:48,904 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:48,904 INFO ]: Analyzing trace with hash -1481100943, now seen corresponding path program 13 times [2018-06-24 20:51:48,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:48,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:48,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,905 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:48,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:48,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:49,182 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:49,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:49,200 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-24 20:51:49,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:49,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:49,242 INFO ]: Computing forward predicates... [2018-06-24 20:51:49,319 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:49,337 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:49,337 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-24 20:51:49,338 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:51:49,338 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:51:49,338 INFO ]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:51:49,338 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 20 states. [2018-06-24 20:51:50,278 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-24 20:51:50,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:50,442 INFO ]: Finished difference Result 41 states and 49 transitions. [2018-06-24 20:51:50,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:51:50,442 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-24 20:51:50,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:50,442 INFO ]: With dead ends: 41 [2018-06-24 20:51:50,442 INFO ]: Without dead ends: 41 [2018-06-24 20:51:50,443 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:51:50,443 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:51:50,444 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-24 20:51:50,444 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:51:50,444 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-06-24 20:51:50,444 INFO ]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2018-06-24 20:51:50,444 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:50,444 INFO ]: Abstraction has 32 states and 38 transitions. [2018-06-24 20:51:50,444 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:51:50,444 INFO ]: Start isEmpty. Operand 32 states and 38 transitions. [2018-06-24 20:51:50,444 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:51:50,444 INFO ]: Found error trace [2018-06-24 20:51:50,444 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:50,445 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:50,445 INFO ]: Analyzing trace with hash -953471608, now seen corresponding path program 14 times [2018-06-24 20:51:50,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:50,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:50,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:50,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:50,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:51,362 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:51,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:51,363 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-24 20:51:51,374 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:51,425 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:51,425 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:51,427 INFO ]: Computing forward predicates... [2018-06-24 20:51:51,551 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:51,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:51,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:51:51,571 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:51:51,572 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:51:51,572 INFO ]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:51:51,572 INFO ]: Start difference. First operand 32 states and 38 transitions. Second operand 21 states. [2018-06-24 20:51:51,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:51,717 INFO ]: Finished difference Result 41 states and 48 transitions. [2018-06-24 20:51:51,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:51:51,717 INFO ]: Start accepts. Automaton has 21 states. Word has length 17 [2018-06-24 20:51:51,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:51,718 INFO ]: With dead ends: 41 [2018-06-24 20:51:51,718 INFO ]: Without dead ends: 34 [2018-06-24 20:51:51,718 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:51:51,718 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:51:51,719 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-06-24 20:51:51,719 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:51:51,719 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-06-24 20:51:51,719 INFO ]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2018-06-24 20:51:51,719 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:51,719 INFO ]: Abstraction has 33 states and 39 transitions. [2018-06-24 20:51:51,719 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:51:51,719 INFO ]: Start isEmpty. Operand 33 states and 39 transitions. [2018-06-24 20:51:51,719 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:51:51,719 INFO ]: Found error trace [2018-06-24 20:51:51,719 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:51,719 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:51,719 INFO ]: Analyzing trace with hash -1505802102, now seen corresponding path program 16 times [2018-06-24 20:51:51,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:51,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:51,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,720 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:51,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:51,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,014 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:52,014 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-24 20:51:52,019 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:52,046 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:52,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:52,048 INFO ]: Computing forward predicates... [2018-06-24 20:51:52,704 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:52,723 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:52,723 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2018-06-24 20:51:52,723 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:51:52,723 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:51:52,723 INFO ]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:52,723 INFO ]: Start difference. First operand 33 states and 39 transitions. Second operand 24 states. [2018-06-24 20:51:53,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:53,015 INFO ]: Finished difference Result 49 states and 57 transitions. [2018-06-24 20:51:53,015 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:51:53,015 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-24 20:51:53,015 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:53,015 INFO ]: With dead ends: 49 [2018-06-24 20:51:53,015 INFO ]: Without dead ends: 49 [2018-06-24 20:51:53,016 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:51:53,016 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:51:53,017 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-06-24 20:51:53,017 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:51:53,017 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-24 20:51:53,017 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 18 [2018-06-24 20:51:53,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:53,017 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-24 20:51:53,017 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:51:53,017 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-24 20:51:53,018 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:51:53,018 INFO ]: Found error trace [2018-06-24 20:51:53,018 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:53,018 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:53,018 INFO ]: Analyzing trace with hash -622568815, now seen corresponding path program 6 times [2018-06-24 20:51:53,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:53,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:53,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:53,018 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:53,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:53,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:53,214 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:53,214 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:53,214 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:53,219 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:53,252 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:51:53,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:53,254 INFO ]: Computing forward predicates... [2018-06-24 20:51:53,369 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:53,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:53,388 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2018-06-24 20:51:53,388 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:51:53,388 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:51:53,388 INFO ]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:53,388 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 24 states. [2018-06-24 20:51:53,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:53,667 INFO ]: Finished difference Result 51 states and 60 transitions. [2018-06-24 20:51:53,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:51:53,667 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-24 20:51:53,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:53,667 INFO ]: With dead ends: 51 [2018-06-24 20:51:53,667 INFO ]: Without dead ends: 51 [2018-06-24 20:51:53,667 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:51:53,668 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:51:53,669 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-06-24 20:51:53,669 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:51:53,669 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-06-24 20:51:53,669 INFO ]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-06-24 20:51:53,669 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:53,669 INFO ]: Abstraction has 35 states and 42 transitions. [2018-06-24 20:51:53,669 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:51:53,669 INFO ]: Start isEmpty. Operand 35 states and 42 transitions. [2018-06-24 20:51:53,669 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:51:53,669 INFO ]: Found error trace [2018-06-24 20:51:53,670 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:53,670 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:53,670 INFO ]: Analyzing trace with hash 1329018703, now seen corresponding path program 15 times [2018-06-24 20:51:53,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:53,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:53,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:53,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:53,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:53,677 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,001 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,001 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:54,001 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:54,006 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:54,037 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:51:54,037 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:54,039 INFO ]: Computing forward predicates... [2018-06-24 20:51:54,069 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:54,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:54,088 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:51:54,088 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:51:54,088 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:51:54,088 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:51:54,088 INFO ]: Start difference. First operand 35 states and 42 transitions. Second operand 16 states. [2018-06-24 20:51:54,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:54,344 INFO ]: Finished difference Result 46 states and 55 transitions. [2018-06-24 20:51:54,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:51:54,344 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:51:54,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:54,344 INFO ]: With dead ends: 46 [2018-06-24 20:51:54,344 INFO ]: Without dead ends: 46 [2018-06-24 20:51:54,344 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:51:54,344 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:51:54,345 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-06-24 20:51:54,345 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:54,346 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-06-24 20:51:54,346 INFO ]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 18 [2018-06-24 20:51:54,346 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:54,346 INFO ]: Abstraction has 37 states and 45 transitions. [2018-06-24 20:51:54,346 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:51:54,346 INFO ]: Start isEmpty. Operand 37 states and 45 transitions. [2018-06-24 20:51:54,346 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:51:54,346 INFO ]: Found error trace [2018-06-24 20:51:54,346 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:54,346 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:54,346 INFO ]: Analyzing trace with hash 39764174, now seen corresponding path program 17 times [2018-06-24 20:51:54,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:54,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:54,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:54,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:54,351 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:55,159 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:55,159 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:55,159 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:55,170 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:55,200 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:51:55,200 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:55,202 INFO ]: Computing forward predicates... [2018-06-24 20:51:55,265 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:55,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:55,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-24 20:51:55,284 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:51:55,284 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:51:55,284 INFO ]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:51:55,284 INFO ]: Start difference. First operand 37 states and 45 transitions. Second operand 23 states. [2018-06-24 20:51:55,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:55,505 INFO ]: Finished difference Result 53 states and 63 transitions. [2018-06-24 20:51:55,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:51:55,505 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:51:55,506 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:55,506 INFO ]: With dead ends: 53 [2018-06-24 20:51:55,506 INFO ]: Without dead ends: 53 [2018-06-24 20:51:55,506 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=875, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:51:55,506 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:51:55,508 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-06-24 20:51:55,508 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:51:55,508 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-06-24 20:51:55,508 INFO ]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 19 [2018-06-24 20:51:55,508 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:55,508 INFO ]: Abstraction has 36 states and 43 transitions. [2018-06-24 20:51:55,508 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:51:55,508 INFO ]: Start isEmpty. Operand 36 states and 43 transitions. [2018-06-24 20:51:55,508 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:51:55,508 INFO ]: Found error trace [2018-06-24 20:51:55,508 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:55,508 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:55,508 INFO ]: Analyzing trace with hash 563669096, now seen corresponding path program 18 times [2018-06-24 20:51:55,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:55,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:55,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:55,509 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:55,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:55,513 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:55,716 INFO ]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:55,717 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:55,717 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:55,723 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:55,753 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:51:55,753 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:55,754 INFO ]: Computing forward predicates... [2018-06-24 20:51:55,867 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:55,886 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:55,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-24 20:51:55,886 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:51:55,886 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:51:55,886 INFO ]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:55,887 INFO ]: Start difference. First operand 36 states and 43 transitions. Second operand 24 states. [2018-06-24 20:51:56,007 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:56,007 INFO ]: Finished difference Result 54 states and 63 transitions. [2018-06-24 20:51:56,007 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:51:56,007 INFO ]: Start accepts. Automaton has 24 states. Word has length 19 [2018-06-24 20:51:56,007 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:56,007 INFO ]: With dead ends: 54 [2018-06-24 20:51:56,007 INFO ]: Without dead ends: 46 [2018-06-24 20:51:56,007 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:51:56,007 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:51:56,008 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-06-24 20:51:56,008 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:56,009 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-06-24 20:51:56,009 INFO ]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 19 [2018-06-24 20:51:56,009 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:56,009 INFO ]: Abstraction has 37 states and 44 transitions. [2018-06-24 20:51:56,009 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:51:56,009 INFO ]: Start isEmpty. Operand 37 states and 44 transitions. [2018-06-24 20:51:56,009 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:51:56,009 INFO ]: Found error trace [2018-06-24 20:51:56,009 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:56,009 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:56,009 INFO ]: Analyzing trace with hash -928225688, now seen corresponding path program 16 times [2018-06-24 20:51:56,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:56,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:56,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:56,009 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:56,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:56,013 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:56,123 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:56,123 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:56,123 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:56,128 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:56,156 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:56,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:56,158 INFO ]: Computing forward predicates... [2018-06-24 20:51:56,291 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:56,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:56,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-24 20:51:56,311 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:51:56,311 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:51:56,311 INFO ]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:51:56,311 INFO ]: Start difference. First operand 37 states and 44 transitions. Second operand 23 states. [2018-06-24 20:51:56,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:56,531 INFO ]: Finished difference Result 46 states and 54 transitions. [2018-06-24 20:51:56,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:51:56,532 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:51:56,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:56,532 INFO ]: With dead ends: 46 [2018-06-24 20:51:56,532 INFO ]: Without dead ends: 46 [2018-06-24 20:51:56,532 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=875, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:51:56,532 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:51:56,533 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-06-24 20:51:56,533 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:51:56,533 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-06-24 20:51:56,533 INFO ]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2018-06-24 20:51:56,534 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:56,534 INFO ]: Abstraction has 36 states and 42 transitions. [2018-06-24 20:51:56,534 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:51:56,534 INFO ]: Start isEmpty. Operand 36 states and 42 transitions. [2018-06-24 20:51:56,534 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:51:56,534 INFO ]: Found error trace [2018-06-24 20:51:56,534 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:56,534 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:56,534 INFO ]: Analyzing trace with hash -1751585487, now seen corresponding path program 17 times [2018-06-24 20:51:56,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:56,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:56,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:56,535 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:56,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:56,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:57,185 INFO ]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:57,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:57,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:57,193 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:57,225 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:51:57,225 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:57,227 INFO ]: Computing forward predicates... [2018-06-24 20:51:57,459 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:57,478 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:57,478 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-24 20:51:57,478 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:51:57,478 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:51:57,478 INFO ]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:51:57,478 INFO ]: Start difference. First operand 36 states and 42 transitions. Second operand 24 states. [2018-06-24 20:51:57,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:57,596 INFO ]: Finished difference Result 46 states and 53 transitions. [2018-06-24 20:51:57,596 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:51:57,596 INFO ]: Start accepts. Automaton has 24 states. Word has length 19 [2018-06-24 20:51:57,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:57,597 INFO ]: With dead ends: 46 [2018-06-24 20:51:57,597 INFO ]: Without dead ends: 38 [2018-06-24 20:51:57,597 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:51:57,597 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:51:57,598 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-24 20:51:57,598 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:57,598 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-06-24 20:51:57,598 INFO ]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 19 [2018-06-24 20:51:57,598 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:57,598 INFO ]: Abstraction has 37 states and 43 transitions. [2018-06-24 20:51:57,598 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:51:57,598 INFO ]: Start isEmpty. Operand 37 states and 43 transitions. [2018-06-24 20:51:57,599 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:51:57,599 INFO ]: Found error trace [2018-06-24 20:51:57,599 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:57,599 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:57,599 INFO ]: Analyzing trace with hash 1231583396, now seen corresponding path program 19 times [2018-06-24 20:51:57,599 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:57,599 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:57,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:57,599 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:57,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:57,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:57,872 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:57,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:57,872 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:57,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:57,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:57,910 INFO ]: Computing forward predicates... [2018-06-24 20:51:58,106 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:58,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:58,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-06-24 20:51:58,126 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:51:58,126 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:51:58,126 INFO ]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:51:58,126 INFO ]: Start difference. First operand 37 states and 43 transitions. Second operand 27 states. [2018-06-24 20:51:58,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:58,599 INFO ]: Finished difference Result 55 states and 63 transitions. [2018-06-24 20:51:58,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:51:58,599 INFO ]: Start accepts. Automaton has 27 states. Word has length 20 [2018-06-24 20:51:58,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:58,600 INFO ]: With dead ends: 55 [2018-06-24 20:51:58,600 INFO ]: Without dead ends: 55 [2018-06-24 20:51:58,600 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:51:58,600 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:51:58,601 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-06-24 20:51:58,601 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:51:58,602 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-24 20:51:58,602 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 20 [2018-06-24 20:51:58,602 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:58,602 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-24 20:51:58,602 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:51:58,602 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-24 20:51:58,602 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:51:58,602 INFO ]: Found error trace [2018-06-24 20:51:58,602 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:58,602 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:58,602 INFO ]: Analyzing trace with hash -384752405, now seen corresponding path program 7 times [2018-06-24 20:51:58,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:58,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:58,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:58,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:58,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:58,613 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:59,026 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:59,026 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:59,026 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:59,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:59,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:59,071 INFO ]: Computing forward predicates... [2018-06-24 20:51:59,209 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:59,228 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:59,228 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-06-24 20:51:59,228 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:51:59,228 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:51:59,229 INFO ]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:51:59,229 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 27 states. [2018-06-24 20:51:59,507 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:59,508 INFO ]: Finished difference Result 57 states and 66 transitions. [2018-06-24 20:51:59,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:51:59,508 INFO ]: Start accepts. Automaton has 27 states. Word has length 20 [2018-06-24 20:51:59,508 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:59,508 INFO ]: With dead ends: 57 [2018-06-24 20:51:59,508 INFO ]: Without dead ends: 57 [2018-06-24 20:51:59,508 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:51:59,508 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:51:59,510 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 39. [2018-06-24 20:51:59,510 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:51:59,510 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-24 20:51:59,510 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 20 [2018-06-24 20:51:59,510 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:59,510 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-24 20:51:59,510 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:51:59,510 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-24 20:51:59,510 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:51:59,510 INFO ]: Found error trace [2018-06-24 20:51:59,510 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:59,510 INFO ]: === Iteration 65 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:59,511 INFO ]: Analyzing trace with hash 1288282424, now seen corresponding path program 18 times [2018-06-24 20:51:59,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:59,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:59,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:59,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:59,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:59,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:59,708 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:59,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:59,708 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:59,714 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:59,807 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:51:59,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:59,811 INFO ]: Computing forward predicates... [2018-06-24 20:51:59,945 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:59,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:59,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:51:59,964 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:51:59,964 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:51:59,964 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:51:59,964 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 18 states. [2018-06-24 20:52:00,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:00,239 INFO ]: Finished difference Result 51 states and 60 transitions. [2018-06-24 20:52:00,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:52:00,239 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:52:00,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:00,239 INFO ]: With dead ends: 51 [2018-06-24 20:52:00,239 INFO ]: Without dead ends: 51 [2018-06-24 20:52:00,239 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:00,239 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:52:00,240 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-24 20:52:00,240 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:52:00,240 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-06-24 20:52:00,241 INFO ]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 20 [2018-06-24 20:52:00,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:00,241 INFO ]: Abstraction has 41 states and 49 transitions. [2018-06-24 20:52:00,241 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:52:00,241 INFO ]: Start isEmpty. Operand 41 states and 49 transitions. [2018-06-24 20:52:00,241 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:00,241 INFO ]: Found error trace [2018-06-24 20:52:00,241 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:00,241 INFO ]: === Iteration 66 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:00,241 INFO ]: Analyzing trace with hash 462090216, now seen corresponding path program 20 times [2018-06-24 20:52:00,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:00,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:00,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:00,241 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:00,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:00,247 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:00,361 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:00,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:00,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:00,368 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:00,400 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:00,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:00,402 INFO ]: Computing forward predicates... [2018-06-24 20:52:00,478 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:00,498 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:00,498 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-24 20:52:00,498 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:52:00,498 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:52:00,498 INFO ]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:52:00,498 INFO ]: Start difference. First operand 41 states and 49 transitions. Second operand 26 states. [2018-06-24 20:52:00,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:00,737 INFO ]: Finished difference Result 59 states and 69 transitions. [2018-06-24 20:52:00,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:52:00,737 INFO ]: Start accepts. Automaton has 26 states. Word has length 21 [2018-06-24 20:52:00,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:00,738 INFO ]: With dead ends: 59 [2018-06-24 20:52:00,738 INFO ]: Without dead ends: 59 [2018-06-24 20:52:00,738 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:52:00,738 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 20:52:00,739 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 40. [2018-06-24 20:52:00,739 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:52:00,739 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-06-24 20:52:00,739 INFO ]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-06-24 20:52:00,740 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:00,740 INFO ]: Abstraction has 40 states and 47 transitions. [2018-06-24 20:52:00,740 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:52:00,740 INFO ]: Start isEmpty. Operand 40 states and 47 transitions. [2018-06-24 20:52:00,740 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:00,740 INFO ]: Found error trace [2018-06-24 20:52:00,740 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:00,740 INFO ]: === Iteration 67 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:00,740 INFO ]: Analyzing trace with hash -476726386, now seen corresponding path program 21 times [2018-06-24 20:52:00,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:00,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:00,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:00,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:00,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:00,749 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:00,855 INFO ]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:00,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:00,855 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:00,861 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:00,896 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:52:00,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:00,898 INFO ]: Computing forward predicates... [2018-06-24 20:52:01,077 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:01,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:01,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-24 20:52:01,096 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:52:01,096 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:52:01,096 INFO ]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:52:01,096 INFO ]: Start difference. First operand 40 states and 47 transitions. Second operand 27 states. [2018-06-24 20:52:01,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:01,238 INFO ]: Finished difference Result 60 states and 69 transitions. [2018-06-24 20:52:01,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:52:01,239 INFO ]: Start accepts. Automaton has 27 states. Word has length 21 [2018-06-24 20:52:01,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:01,239 INFO ]: With dead ends: 60 [2018-06-24 20:52:01,239 INFO ]: Without dead ends: 51 [2018-06-24 20:52:01,239 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:01,239 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:52:01,240 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-24 20:52:01,240 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:52:01,240 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-06-24 20:52:01,240 INFO ]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2018-06-24 20:52:01,240 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:01,240 INFO ]: Abstraction has 41 states and 48 transitions. [2018-06-24 20:52:01,240 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:52:01,240 INFO ]: Start isEmpty. Operand 41 states and 48 transitions. [2018-06-24 20:52:01,240 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:01,240 INFO ]: Found error trace [2018-06-24 20:52:01,240 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:01,240 INFO ]: === Iteration 68 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:01,240 INFO ]: Analyzing trace with hash 1034907153, now seen corresponding path program 19 times [2018-06-24 20:52:01,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:01,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:01,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:01,241 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:01,241 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:01,245 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:01,492 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:01,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:01,492 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:01,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:01,552 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:01,554 INFO ]: Computing forward predicates... [2018-06-24 20:52:01,631 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:01,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:01,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-24 20:52:01,650 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:52:01,650 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:52:01,650 INFO ]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:52:01,650 INFO ]: Start difference. First operand 41 states and 48 transitions. Second operand 26 states. [2018-06-24 20:52:01,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:01,920 INFO ]: Finished difference Result 51 states and 59 transitions. [2018-06-24 20:52:01,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:52:01,920 INFO ]: Start accepts. Automaton has 26 states. Word has length 21 [2018-06-24 20:52:01,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:01,920 INFO ]: With dead ends: 51 [2018-06-24 20:52:01,920 INFO ]: Without dead ends: 51 [2018-06-24 20:52:01,921 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:52:01,921 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:52:01,921 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-06-24 20:52:01,921 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:52:01,922 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-06-24 20:52:01,922 INFO ]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2018-06-24 20:52:01,922 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:01,922 INFO ]: Abstraction has 40 states and 46 transitions. [2018-06-24 20:52:01,922 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:52:01,922 INFO ]: Start isEmpty. Operand 40 states and 46 transitions. [2018-06-24 20:52:01,922 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:01,922 INFO ]: Found error trace [2018-06-24 20:52:01,922 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:01,922 INFO ]: === Iteration 69 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:01,922 INFO ]: Analyzing trace with hash 1280557160, now seen corresponding path program 20 times [2018-06-24 20:52:01,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:01,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:01,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:01,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:01,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:01,926 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:02,247 INFO ]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:02,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:02,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:02,253 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:02,287 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:02,287 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:02,289 INFO ]: Computing forward predicates... [2018-06-24 20:52:02,412 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:02,431 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:02,431 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-06-24 20:52:02,431 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:52:02,431 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:52:02,431 INFO ]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:52:02,431 INFO ]: Start difference. First operand 40 states and 46 transitions. Second operand 27 states. [2018-06-24 20:52:02,594 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:02,594 INFO ]: Finished difference Result 51 states and 58 transitions. [2018-06-24 20:52:02,594 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:52:02,595 INFO ]: Start accepts. Automaton has 27 states. Word has length 21 [2018-06-24 20:52:02,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:02,595 INFO ]: With dead ends: 51 [2018-06-24 20:52:02,595 INFO ]: Without dead ends: 42 [2018-06-24 20:52:02,595 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:02,595 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:52:02,596 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-06-24 20:52:02,596 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:52:02,597 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-06-24 20:52:02,597 INFO ]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 21 [2018-06-24 20:52:02,597 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:02,597 INFO ]: Abstraction has 41 states and 47 transitions. [2018-06-24 20:52:02,597 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:52:02,597 INFO ]: Start isEmpty. Operand 41 states and 47 transitions. [2018-06-24 20:52:02,597 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:52:02,597 INFO ]: Found error trace [2018-06-24 20:52:02,597 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:02,597 INFO ]: === Iteration 70 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:02,597 INFO ]: Analyzing trace with hash 1438788810, now seen corresponding path program 22 times [2018-06-24 20:52:02,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:02,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:02,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:02,598 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:02,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:02,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:03,045 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:03,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:03,046 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:03,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:03,088 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:03,088 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:03,091 INFO ]: Computing forward predicates... [2018-06-24 20:52:03,352 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:03,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:03,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-06-24 20:52:03,378 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:52:03,379 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:52:03,379 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:03,379 INFO ]: Start difference. First operand 41 states and 47 transitions. Second operand 30 states. [2018-06-24 20:52:03,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:03,809 INFO ]: Finished difference Result 61 states and 69 transitions. [2018-06-24 20:52:03,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:03,809 INFO ]: Start accepts. Automaton has 30 states. Word has length 22 [2018-06-24 20:52:03,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:03,809 INFO ]: With dead ends: 61 [2018-06-24 20:52:03,809 INFO ]: Without dead ends: 61 [2018-06-24 20:52:03,810 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:52:03,810 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:52:03,811 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-06-24 20:52:03,811 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 20:52:03,811 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-06-24 20:52:03,811 INFO ]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-06-24 20:52:03,811 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:03,811 INFO ]: Abstraction has 50 states and 57 transitions. [2018-06-24 20:52:03,811 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:52:03,811 INFO ]: Start isEmpty. Operand 50 states and 57 transitions. [2018-06-24 20:52:03,811 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:52:03,811 INFO ]: Found error trace [2018-06-24 20:52:03,811 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:03,811 INFO ]: === Iteration 71 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:03,812 INFO ]: Analyzing trace with hash -1376722095, now seen corresponding path program 8 times [2018-06-24 20:52:03,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:03,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:03,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:03,812 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:03,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:03,818 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:04,000 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:04,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:04,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:04,006 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:04,040 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:04,040 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:04,043 INFO ]: Computing forward predicates... [2018-06-24 20:52:04,279 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:04,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:04,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-06-24 20:52:04,298 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:52:04,298 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:52:04,298 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:04,298 INFO ]: Start difference. First operand 50 states and 57 transitions. Second operand 30 states. [2018-06-24 20:52:04,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:04,669 INFO ]: Finished difference Result 63 states and 72 transitions. [2018-06-24 20:52:04,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:04,669 INFO ]: Start accepts. Automaton has 30 states. Word has length 22 [2018-06-24 20:52:04,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:04,669 INFO ]: With dead ends: 63 [2018-06-24 20:52:04,669 INFO ]: Without dead ends: 63 [2018-06-24 20:52:04,670 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:52:04,670 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-24 20:52:04,671 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 43. [2018-06-24 20:52:04,671 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:52:04,671 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-06-24 20:52:04,671 INFO ]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 22 [2018-06-24 20:52:04,671 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:04,671 INFO ]: Abstraction has 43 states and 50 transitions. [2018-06-24 20:52:04,671 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:52:04,671 INFO ]: Start isEmpty. Operand 43 states and 50 transitions. [2018-06-24 20:52:04,671 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:52:04,672 INFO ]: Found error trace [2018-06-24 20:52:04,672 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:04,672 INFO ]: === Iteration 72 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:04,672 INFO ]: Analyzing trace with hash 2015858351, now seen corresponding path program 21 times [2018-06-24 20:52:04,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:04,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:04,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:04,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,036 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:05,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:05,045 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:05,087 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:52:05,087 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,090 INFO ]: Computing forward predicates... [2018-06-24 20:52:05,157 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:05,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:52:05,176 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:52:05,176 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:52:05,176 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:52:05,176 INFO ]: Start difference. First operand 43 states and 50 transitions. Second operand 20 states. [2018-06-24 20:52:05,529 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:05,529 INFO ]: Finished difference Result 56 states and 65 transitions. [2018-06-24 20:52:05,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:05,529 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:52:05,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:05,529 INFO ]: With dead ends: 56 [2018-06-24 20:52:05,529 INFO ]: Without dead ends: 56 [2018-06-24 20:52:05,529 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:52:05,529 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 20:52:05,530 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 45. [2018-06-24 20:52:05,530 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:52:05,531 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-06-24 20:52:05,531 INFO ]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 22 [2018-06-24 20:52:05,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:05,531 INFO ]: Abstraction has 45 states and 53 transitions. [2018-06-24 20:52:05,531 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:52:05,531 INFO ]: Start isEmpty. Operand 45 states and 53 transitions. [2018-06-24 20:52:05,531 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:05,531 INFO ]: Found error trace [2018-06-24 20:52:05,531 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:05,531 INFO ]: === Iteration 73 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:05,531 INFO ]: Analyzing trace with hash 690217742, now seen corresponding path program 23 times [2018-06-24 20:52:05,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:05,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:05,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:05,531 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:05,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:05,536 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,697 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:05,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:05,704 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:05,744 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:52:05,744 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,746 INFO ]: Computing forward predicates... [2018-06-24 20:52:05,873 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,892 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:05,892 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-24 20:52:05,892 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:52:05,892 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:52:05,893 INFO ]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:52:05,893 INFO ]: Start difference. First operand 45 states and 53 transitions. Second operand 29 states. [2018-06-24 20:52:06,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,204 INFO ]: Finished difference Result 65 states and 75 transitions. [2018-06-24 20:52:06,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:52:06,204 INFO ]: Start accepts. Automaton has 29 states. Word has length 23 [2018-06-24 20:52:06,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,204 INFO ]: With dead ends: 65 [2018-06-24 20:52:06,204 INFO ]: Without dead ends: 65 [2018-06-24 20:52:06,204 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=621, Invalid=1449, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:52:06,205 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-24 20:52:06,205 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 44. [2018-06-24 20:52:06,205 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:52:06,206 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-06-24 20:52:06,206 INFO ]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 23 [2018-06-24 20:52:06,206 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,206 INFO ]: Abstraction has 44 states and 51 transitions. [2018-06-24 20:52:06,206 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:52:06,206 INFO ]: Start isEmpty. Operand 44 states and 51 transitions. [2018-06-24 20:52:06,206 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:06,206 INFO ]: Found error trace [2018-06-24 20:52:06,206 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,206 INFO ]: === Iteration 74 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,206 INFO ]: Analyzing trace with hash 1651674152, now seen corresponding path program 24 times [2018-06-24 20:52:06,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:06,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,211 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,478 INFO ]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:06,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:06,483 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:06,521 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:52:06,521 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,523 INFO ]: Computing forward predicates... [2018-06-24 20:52:06,768 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,787 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:06,787 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-24 20:52:06,787 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:52:06,787 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:52:06,787 INFO ]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:06,787 INFO ]: Start difference. First operand 44 states and 51 transitions. Second operand 30 states. [2018-06-24 20:52:06,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,994 INFO ]: Finished difference Result 66 states and 75 transitions. [2018-06-24 20:52:06,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:06,994 INFO ]: Start accepts. Automaton has 30 states. Word has length 23 [2018-06-24 20:52:06,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,994 INFO ]: With dead ends: 66 [2018-06-24 20:52:06,994 INFO ]: Without dead ends: 56 [2018-06-24 20:52:06,995 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:52:06,995 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 20:52:06,996 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 45. [2018-06-24 20:52:06,996 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:52:06,996 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-24 20:52:06,996 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 23 [2018-06-24 20:52:06,996 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,996 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-24 20:52:06,996 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:52:06,996 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-24 20:52:06,997 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:06,997 INFO ]: Found error trace [2018-06-24 20:52:06,997 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,997 INFO ]: === Iteration 75 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,997 INFO ]: Analyzing trace with hash -959608504, now seen corresponding path program 22 times [2018-06-24 20:52:06,997 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,997 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,997 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:06,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,002 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,109 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:07,109 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:07,114 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:07,149 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:07,149 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,151 INFO ]: Computing forward predicates... [2018-06-24 20:52:07,257 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,276 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:07,276 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-24 20:52:07,276 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:52:07,276 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:52:07,276 INFO ]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:52:07,277 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 29 states. [2018-06-24 20:52:07,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:07,630 INFO ]: Finished difference Result 56 states and 64 transitions. [2018-06-24 20:52:07,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:52:07,630 INFO ]: Start accepts. Automaton has 29 states. Word has length 23 [2018-06-24 20:52:07,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:07,630 INFO ]: With dead ends: 56 [2018-06-24 20:52:07,630 INFO ]: Without dead ends: 56 [2018-06-24 20:52:07,631 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=621, Invalid=1449, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:52:07,631 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 20:52:07,631 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-06-24 20:52:07,632 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:52:07,632 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-06-24 20:52:07,632 INFO ]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2018-06-24 20:52:07,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:07,632 INFO ]: Abstraction has 44 states and 50 transitions. [2018-06-24 20:52:07,632 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:52:07,632 INFO ]: Start isEmpty. Operand 44 states and 50 transitions. [2018-06-24 20:52:07,632 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:07,632 INFO ]: Found error trace [2018-06-24 20:52:07,632 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:07,632 INFO ]: === Iteration 76 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:07,632 INFO ]: Analyzing trace with hash -1934392879, now seen corresponding path program 23 times [2018-06-24 20:52:07,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:07,632 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,639 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,881 INFO ]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:07,881 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:07,886 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:07,925 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:52:07,925 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,927 INFO ]: Computing forward predicates... [2018-06-24 20:52:08,063 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:08,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2018-06-24 20:52:08,081 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:52:08,082 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:52:08,082 INFO ]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:08,082 INFO ]: Start difference. First operand 44 states and 50 transitions. Second operand 30 states. [2018-06-24 20:52:08,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:08,325 INFO ]: Finished difference Result 56 states and 63 transitions. [2018-06-24 20:52:08,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:08,325 INFO ]: Start accepts. Automaton has 30 states. Word has length 23 [2018-06-24 20:52:08,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:08,325 INFO ]: With dead ends: 56 [2018-06-24 20:52:08,325 INFO ]: Without dead ends: 46 [2018-06-24 20:52:08,326 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:52:08,326 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:52:08,327 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-06-24 20:52:08,327 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:52:08,327 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-06-24 20:52:08,327 INFO ]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 23 [2018-06-24 20:52:08,327 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:08,327 INFO ]: Abstraction has 45 states and 51 transitions. [2018-06-24 20:52:08,327 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:52:08,327 INFO ]: Start isEmpty. Operand 45 states and 51 transitions. [2018-06-24 20:52:08,327 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:52:08,327 INFO ]: Found error trace [2018-06-24 20:52:08,327 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:08,327 INFO ]: === Iteration 77 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:08,328 INFO ]: Analyzing trace with hash -79192476, now seen corresponding path program 25 times [2018-06-24 20:52:08,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:08,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:08,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,328 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:08,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,333 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,839 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:08,839 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:08,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:08,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,905 INFO ]: Computing forward predicates... [2018-06-24 20:52:09,254 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:09,273 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-06-24 20:52:09,273 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:52:09,273 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:52:09,273 INFO ]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:52:09,273 INFO ]: Start difference. First operand 45 states and 51 transitions. Second operand 33 states. [2018-06-24 20:52:09,820 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:09,821 INFO ]: Finished difference Result 67 states and 75 transitions. [2018-06-24 20:52:09,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:09,821 INFO ]: Start accepts. Automaton has 33 states. Word has length 24 [2018-06-24 20:52:09,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:09,821 INFO ]: With dead ends: 67 [2018-06-24 20:52:09,821 INFO ]: Without dead ends: 67 [2018-06-24 20:52:09,821 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:52:09,821 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:52:09,823 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-06-24 20:52:09,823 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 20:52:09,823 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-06-24 20:52:09,823 INFO ]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 24 [2018-06-24 20:52:09,823 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:09,823 INFO ]: Abstraction has 55 states and 62 transitions. [2018-06-24 20:52:09,823 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:52:09,823 INFO ]: Start isEmpty. Operand 55 states and 62 transitions. [2018-06-24 20:52:09,824 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:52:09,824 INFO ]: Found error trace [2018-06-24 20:52:09,825 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:09,825 INFO ]: === Iteration 78 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:09,825 INFO ]: Analyzing trace with hash 44224299, now seen corresponding path program 9 times [2018-06-24 20:52:09,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:09,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:09,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:09,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,833 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,166 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,166 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:10,166 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:10,171 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:10,217 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:52:10,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,220 INFO ]: Computing forward predicates... [2018-06-24 20:52:10,456 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:10,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-06-24 20:52:10,475 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:52:10,475 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:52:10,475 INFO ]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:52:10,475 INFO ]: Start difference. First operand 55 states and 62 transitions. Second operand 33 states. [2018-06-24 20:52:10,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:10,918 INFO ]: Finished difference Result 69 states and 78 transitions. [2018-06-24 20:52:10,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:10,918 INFO ]: Start accepts. Automaton has 33 states. Word has length 24 [2018-06-24 20:52:10,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:10,919 INFO ]: With dead ends: 69 [2018-06-24 20:52:10,919 INFO ]: Without dead ends: 69 [2018-06-24 20:52:10,919 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1794, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:52:10,919 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 20:52:10,920 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 47. [2018-06-24 20:52:10,920 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:52:10,921 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-06-24 20:52:10,921 INFO ]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2018-06-24 20:52:10,921 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:10,921 INFO ]: Abstraction has 47 states and 54 transitions. [2018-06-24 20:52:10,921 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:52:10,921 INFO ]: Start isEmpty. Operand 47 states and 54 transitions. [2018-06-24 20:52:10,921 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:52:10,921 INFO ]: Found error trace [2018-06-24 20:52:10,921 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:10,921 INFO ]: === Iteration 79 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:10,921 INFO ]: Analyzing trace with hash 315415128, now seen corresponding path program 24 times [2018-06-24 20:52:10,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:10,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:10,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,922 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:10,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,930 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:11,148 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:11,148 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:11,148 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:11,153 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:11,201 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:52:11,201 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:11,205 INFO ]: Computing forward predicates... [2018-06-24 20:52:11,251 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:11,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:11,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:52:11,271 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:52:11,271 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:52:11,271 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:11,271 INFO ]: Start difference. First operand 47 states and 54 transitions. Second operand 22 states. [2018-06-24 20:52:11,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:11,667 INFO ]: Finished difference Result 61 states and 70 transitions. [2018-06-24 20:52:11,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:11,667 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:52:11,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:11,668 INFO ]: With dead ends: 61 [2018-06-24 20:52:11,668 INFO ]: Without dead ends: 61 [2018-06-24 20:52:11,668 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:52:11,668 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:52:11,669 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-24 20:52:11,669 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:52:11,669 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-06-24 20:52:11,669 INFO ]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2018-06-24 20:52:11,669 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:11,669 INFO ]: Abstraction has 49 states and 57 transitions. [2018-06-24 20:52:11,669 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:52:11,669 INFO ]: Start isEmpty. Operand 49 states and 57 transitions. [2018-06-24 20:52:11,669 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:11,669 INFO ]: Found error trace [2018-06-24 20:52:11,669 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:11,669 INFO ]: === Iteration 80 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:11,669 INFO ]: Analyzing trace with hash 2098516904, now seen corresponding path program 26 times [2018-06-24 20:52:11,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:11,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:11,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:11,670 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:11,670 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:11,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:11,956 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:11,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:11,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:11,962 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:12,000 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:12,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:12,003 INFO ]: Computing forward predicates... [2018-06-24 20:52:12,132 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:12,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:12,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-24 20:52:12,151 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:52:12,151 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:52:12,151 INFO ]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:52:12,151 INFO ]: Start difference. First operand 49 states and 57 transitions. Second operand 32 states. [2018-06-24 20:52:12,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:12,515 INFO ]: Finished difference Result 71 states and 81 transitions. [2018-06-24 20:52:12,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:52:12,515 INFO ]: Start accepts. Automaton has 32 states. Word has length 25 [2018-06-24 20:52:12,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:12,515 INFO ]: With dead ends: 71 [2018-06-24 20:52:12,515 INFO ]: Without dead ends: 71 [2018-06-24 20:52:12,516 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=760, Invalid=1790, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:52:12,516 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-24 20:52:12,516 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-06-24 20:52:12,516 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:52:12,517 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-06-24 20:52:12,517 INFO ]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2018-06-24 20:52:12,517 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:12,517 INFO ]: Abstraction has 48 states and 55 transitions. [2018-06-24 20:52:12,517 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:52:12,517 INFO ]: Start isEmpty. Operand 48 states and 55 transitions. [2018-06-24 20:52:12,517 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:12,517 INFO ]: Found error trace [2018-06-24 20:52:12,517 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:12,517 INFO ]: === Iteration 81 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:12,517 INFO ]: Analyzing trace with hash 1838894542, now seen corresponding path program 27 times [2018-06-24 20:52:12,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:12,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:12,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:12,518 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:12,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:12,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:12,657 INFO ]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:12,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:12,658 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:12,663 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:12,706 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:52:12,706 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:12,708 INFO ]: Computing forward predicates... [2018-06-24 20:52:12,996 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,015 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:13,015 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-06-24 20:52:13,015 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:52:13,015 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:52:13,015 INFO ]: CoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:52:13,016 INFO ]: Start difference. First operand 48 states and 55 transitions. Second operand 33 states. [2018-06-24 20:52:13,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:13,222 INFO ]: Finished difference Result 72 states and 81 transitions. [2018-06-24 20:52:13,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:13,223 INFO ]: Start accepts. Automaton has 33 states. Word has length 25 [2018-06-24 20:52:13,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:13,223 INFO ]: With dead ends: 72 [2018-06-24 20:52:13,223 INFO ]: Without dead ends: 61 [2018-06-24 20:52:13,224 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:52:13,224 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:52:13,224 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-06-24 20:52:13,224 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:52:13,225 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-06-24 20:52:13,225 INFO ]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 25 [2018-06-24 20:52:13,225 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:13,225 INFO ]: Abstraction has 49 states and 56 transitions. [2018-06-24 20:52:13,225 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:52:13,225 INFO ]: Start isEmpty. Operand 49 states and 56 transitions. [2018-06-24 20:52:13,225 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:13,225 INFO ]: Found error trace [2018-06-24 20:52:13,225 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:13,225 INFO ]: === Iteration 82 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:13,225 INFO ]: Analyzing trace with hash 1339986609, now seen corresponding path program 25 times [2018-06-24 20:52:13,225 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:13,225 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:13,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,226 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:13,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,373 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:13,373 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:13,379 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:13,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,420 INFO ]: Computing forward predicates... [2018-06-24 20:52:14,560 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:14,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:14,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-24 20:52:14,579 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:52:14,579 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:52:14,579 INFO ]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:52:14,579 INFO ]: Start difference. First operand 49 states and 56 transitions. Second operand 32 states. [2018-06-24 20:52:14,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:14,944 INFO ]: Finished difference Result 61 states and 69 transitions. [2018-06-24 20:52:14,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:52:14,944 INFO ]: Start accepts. Automaton has 32 states. Word has length 25 [2018-06-24 20:52:14,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:14,944 INFO ]: With dead ends: 61 [2018-06-24 20:52:14,944 INFO ]: Without dead ends: 61 [2018-06-24 20:52:14,945 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=760, Invalid=1790, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:52:14,945 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:52:14,945 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-06-24 20:52:14,945 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:52:14,946 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-06-24 20:52:14,946 INFO ]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 25 [2018-06-24 20:52:14,946 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:14,946 INFO ]: Abstraction has 48 states and 54 transitions. [2018-06-24 20:52:14,946 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:52:14,946 INFO ]: Start isEmpty. Operand 48 states and 54 transitions. [2018-06-24 20:52:14,946 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:14,946 INFO ]: Found error trace [2018-06-24 20:52:14,946 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:14,946 INFO ]: === Iteration 83 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:14,946 INFO ]: Analyzing trace with hash 1186442056, now seen corresponding path program 26 times [2018-06-24 20:52:14,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:14,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:14,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:14,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,951 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:15,204 INFO ]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:15,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:15,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:15,209 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:15,249 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:15,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:15,251 INFO ]: Computing forward predicates... [2018-06-24 20:52:15,417 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:15,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:15,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-06-24 20:52:15,436 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:52:15,436 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:52:15,436 INFO ]: CoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:52:15,436 INFO ]: Start difference. First operand 48 states and 54 transitions. Second operand 33 states. [2018-06-24 20:52:15,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:15,671 INFO ]: Finished difference Result 61 states and 68 transitions. [2018-06-24 20:52:15,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:15,671 INFO ]: Start accepts. Automaton has 33 states. Word has length 25 [2018-06-24 20:52:15,671 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:15,671 INFO ]: With dead ends: 61 [2018-06-24 20:52:15,671 INFO ]: Without dead ends: 50 [2018-06-24 20:52:15,671 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:52:15,671 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:52:15,672 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-06-24 20:52:15,672 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:52:15,673 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-06-24 20:52:15,673 INFO ]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 25 [2018-06-24 20:52:15,673 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:15,673 INFO ]: Abstraction has 49 states and 55 transitions. [2018-06-24 20:52:15,673 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:52:15,673 INFO ]: Start isEmpty. Operand 49 states and 55 transitions. [2018-06-24 20:52:15,673 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:52:15,673 INFO ]: Found error trace [2018-06-24 20:52:15,673 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:15,673 INFO ]: === Iteration 84 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:15,673 INFO ]: Analyzing trace with hash 628408586, now seen corresponding path program 28 times [2018-06-24 20:52:15,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:15,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:15,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:15,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:16,986 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:16,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:16,986 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:16,991 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:17,031 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:17,031 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:17,034 INFO ]: Computing forward predicates... [2018-06-24 20:52:17,368 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:17,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:17,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-06-24 20:52:17,387 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:52:17,388 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:52:17,388 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:17,388 INFO ]: Start difference. First operand 49 states and 55 transitions. Second operand 36 states. [2018-06-24 20:52:17,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:17,994 INFO ]: Finished difference Result 73 states and 81 transitions. [2018-06-24 20:52:17,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:52:17,994 INFO ]: Start accepts. Automaton has 36 states. Word has length 26 [2018-06-24 20:52:17,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:17,994 INFO ]: With dead ends: 73 [2018-06-24 20:52:17,994 INFO ]: Without dead ends: 73 [2018-06-24 20:52:17,994 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=172, Invalid=2180, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:52:17,994 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-24 20:52:17,995 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-06-24 20:52:17,995 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:52:17,996 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-06-24 20:52:17,996 INFO ]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 26 [2018-06-24 20:52:17,996 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:17,996 INFO ]: Abstraction has 60 states and 67 transitions. [2018-06-24 20:52:17,996 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:52:17,996 INFO ]: Start isEmpty. Operand 60 states and 67 transitions. [2018-06-24 20:52:17,996 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:52:17,996 INFO ]: Found error trace [2018-06-24 20:52:17,996 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:17,996 INFO ]: === Iteration 85 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:17,996 INFO ]: Analyzing trace with hash -1027154927, now seen corresponding path program 10 times [2018-06-24 20:52:17,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:17,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:17,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:17,997 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:17,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:18,004 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:18,284 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:18,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:18,285 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:18,290 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:18,333 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:18,333 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:18,336 INFO ]: Computing forward predicates... [2018-06-24 20:52:18,626 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:18,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:18,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-06-24 20:52:18,645 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:52:18,645 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:52:18,645 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:18,645 INFO ]: Start difference. First operand 60 states and 67 transitions. Second operand 36 states. [2018-06-24 20:52:19,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:19,144 INFO ]: Finished difference Result 75 states and 84 transitions. [2018-06-24 20:52:19,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:52:19,144 INFO ]: Start accepts. Automaton has 36 states. Word has length 26 [2018-06-24 20:52:19,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:19,145 INFO ]: With dead ends: 75 [2018-06-24 20:52:19,145 INFO ]: Without dead ends: 75 [2018-06-24 20:52:19,145 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=2148, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:52:19,145 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 20:52:19,147 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 51. [2018-06-24 20:52:19,147 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-24 20:52:19,147 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-06-24 20:52:19,147 INFO ]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2018-06-24 20:52:19,147 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:19,147 INFO ]: Abstraction has 51 states and 58 transitions. [2018-06-24 20:52:19,147 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:52:19,147 INFO ]: Start isEmpty. Operand 51 states and 58 transitions. [2018-06-24 20:52:19,147 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:52:19,147 INFO ]: Found error trace [2018-06-24 20:52:19,147 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:19,147 INFO ]: === Iteration 86 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:19,148 INFO ]: Analyzing trace with hash -1411580401, now seen corresponding path program 27 times [2018-06-24 20:52:19,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:19,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:19,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:19,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:19,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:19,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:19,406 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:19,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:19,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:19,411 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:19,456 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:52:19,456 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:19,461 INFO ]: Computing forward predicates... [2018-06-24 20:52:19,591 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:19,609 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:19,609 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:52:19,609 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:52:19,609 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:52:19,610 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:52:19,610 INFO ]: Start difference. First operand 51 states and 58 transitions. Second operand 24 states. [2018-06-24 20:52:20,070 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:20,070 INFO ]: Finished difference Result 66 states and 75 transitions. [2018-06-24 20:52:20,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:52:20,070 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:52:20,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:20,071 INFO ]: With dead ends: 66 [2018-06-24 20:52:20,071 INFO ]: Without dead ends: 66 [2018-06-24 20:52:20,071 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:52:20,071 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-24 20:52:20,073 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-06-24 20:52:20,073 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 20:52:20,073 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-06-24 20:52:20,073 INFO ]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 26 [2018-06-24 20:52:20,073 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:20,073 INFO ]: Abstraction has 53 states and 61 transitions. [2018-06-24 20:52:20,073 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:52:20,073 INFO ]: Start isEmpty. Operand 53 states and 61 transitions. [2018-06-24 20:52:20,073 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:52:20,073 INFO ]: Found error trace [2018-06-24 20:52:20,073 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:20,073 INFO ]: === Iteration 87 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:20,073 INFO ]: Analyzing trace with hash 1758049614, now seen corresponding path program 29 times [2018-06-24 20:52:20,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:20,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:20,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:20,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,082 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:20,606 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:20,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:20,606 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:20,611 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:20,656 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:52:20,656 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:20,660 INFO ]: Computing forward predicates... [2018-06-24 20:52:20,984 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:21,002 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:21,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-24 20:52:21,003 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:52:21,003 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:52:21,003 INFO ]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:52:21,003 INFO ]: Start difference. First operand 53 states and 61 transitions. Second operand 35 states. [2018-06-24 20:52:21,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:21,435 INFO ]: Finished difference Result 77 states and 87 transitions. [2018-06-24 20:52:21,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:52:21,435 INFO ]: Start accepts. Automaton has 35 states. Word has length 27 [2018-06-24 20:52:21,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:21,436 INFO ]: With dead ends: 77 [2018-06-24 20:52:21,436 INFO ]: Without dead ends: 77 [2018-06-24 20:52:21,436 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=913, Invalid=2167, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:52:21,436 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 20:52:21,437 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 52. [2018-06-24 20:52:21,437 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 20:52:21,437 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-06-24 20:52:21,437 INFO ]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 27 [2018-06-24 20:52:21,437 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:21,437 INFO ]: Abstraction has 52 states and 59 transitions. [2018-06-24 20:52:21,437 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:52:21,438 INFO ]: Start isEmpty. Operand 52 states and 59 transitions. [2018-06-24 20:52:21,438 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:52:21,438 INFO ]: Found error trace [2018-06-24 20:52:21,438 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:21,438 INFO ]: === Iteration 88 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:21,438 INFO ]: Analyzing trace with hash -1995276312, now seen corresponding path program 30 times [2018-06-24 20:52:21,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:21,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:21,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:21,438 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:21,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:21,446 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:21,609 INFO ]: Checked inductivity of 121 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:21,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:21,609 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:21,615 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:21,659 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:52:21,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:21,661 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-24 20:52:21,744 INFO ]: Timeout while computing interpolants [2018-06-24 20:52:21,944 WARN ]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:21,944 WARN ]: Verification canceled [2018-06-24 20:52:21,946 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:52:21,947 WARN ]: Timeout [2018-06-24 20:52:21,947 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:21 BasicIcfg [2018-06-24 20:52:21,947 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:52:21,948 INFO ]: Toolchain (without parser) took 55639.58 ms. Allocated memory was 308.8 MB in the beginning and 753.4 MB in the end (delta: 444.6 MB). Free memory was 260.2 MB in the beginning and 615.7 MB in the end (delta: -355.5 MB). Peak memory consumption was 89.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,948 INFO ]: SmtParser took 0.13 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:52:21,948 INFO ]: ChcToBoogie took 69.56 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,948 INFO ]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,949 INFO ]: RCFGBuilder took 365.03 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 243.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,949 INFO ]: BlockEncodingV2 took 257.58 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 232.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,949 INFO ]: TraceAbstraction took 54901.50 ms. Allocated memory was 308.8 MB in the beginning and 753.4 MB in the end (delta: 444.6 MB). Free memory was 232.2 MB in the beginning and 615.7 MB in the end (delta: -383.5 MB). Peak memory consumption was 61.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:52:21,951 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 17 locations, 24 edges - StatisticsResult: Encoded RCFG 8 locations, 17 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.13 ms. Allocated memory is still 308.8 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.56 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.80 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 365.03 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 243.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 257.58 ms. Allocated memory is still 308.8 MB. Free memory was 243.2 MB in the beginning and 232.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54901.50 ms. Allocated memory was 308.8 MB in the beginning and 753.4 MB in the end (delta: 444.6 MB). Free memory was 232.2 MB in the beginning and 615.7 MB in the end (delta: -383.5 MB). Peak memory consumption was 61.1 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 28 with TraceHistMax 11, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 54.8s OverallTime, 88 OverallIterations, 11 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1202 SDtfs, 962 SDslu, 9205 SDs, 0 SdLazy, 16029 SolverSat, 1738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2858 GetRequests, 866 SyntacticMatches, 58 SemanticMatches, 1934 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10345 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=84, 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.2s AutomataMinimizationTime, 87 MinimizatonAttempts, 695 StatesRemovedByMinimization, 80 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 2496 NumberOfCodeBlocks, 2496 NumberOfCodeBlocksAsserted, 284 NumberOfCheckSat, 2333 ConstructedInterpolants, 0 QuantifiedInterpolants, 229354 SizeOfPredicates, 588 NumberOfNonLiveVariables, 20001 ConjunctsInSsa, 4304 ConjunctsInUnsatCore, 163 InterpolantComputations, 14 PerfectInterpolantSequences, 1700/5996 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-52-21-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-52-21-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-52-21-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop_unswitching_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-52-21-959.csv Completed graceful shutdown