java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:58:12,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:58:12,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:58:12,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:58:12,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:58:12,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:58:12,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:58:12,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:58:12,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:58:12,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:58:12,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:58:12,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:58:12,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:58:12,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:58:12,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:58:12,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:58:12,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:58:12,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:58:12,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:58:12,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:58:12,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:58:12,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:58:12,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:58:12,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:58:12,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:58:12,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:58:12,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:58:12,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:58:12,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:58:12,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:58:12,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:58:12,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:58:12,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:58:12,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:58:12,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:58:12,907 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:58:12,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:58:12,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:58:12,923 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:58:12,923 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:58:12,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:58:12,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:58:12,924 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:58:12,925 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:58:12,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:58:12,925 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:58:12,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:58:12,925 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:58:12,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:58:12,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:58:12,926 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:58:12,926 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:58:12,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:58:12,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:58:12,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:58:12,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:58:12,927 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:58:12,928 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:58:12,928 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:58:12,971 INFO ]: Repository-Root is: /tmp [2018-06-24 20:58:12,988 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:58:12,992 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:58:12,997 INFO ]: Initializing SmtParser... [2018-06-24 20:58:12,998 INFO ]: SmtParser initialized [2018-06-24 20:58:12,998 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-24 20:58:12,999 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:58:13,089 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 unknown [2018-06-24 20:58:13,312 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/005b-horn.smt2 [2018-06-24 20:58:13,316 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:58:13,325 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:58:13,325 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:58:13,325 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:58:13,326 INFO ]: ChcToBoogie initialized [2018-06-24 20:58:13,329 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,388 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13 Unit [2018-06-24 20:58:13,388 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:58:13,389 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:58:13,389 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:58:13,389 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:58:13,411 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,411 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,417 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,418 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,422 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,435 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,436 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,438 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:58:13,438 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:58:13,438 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:58:13,438 INFO ]: RCFGBuilder initialized [2018-06-24 20:58:13,439 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (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:58:13,457 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:58:13,458 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:58:13,458 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:58:13,458 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:58:13,458 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:58:13,458 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:58:13,857 INFO ]: Using library mode [2018-06-24 20:58:13,857 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:13 BoogieIcfgContainer [2018-06-24 20:58:13,858 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:58:13,858 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:58:13,858 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:58:13,859 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:58:13,859 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:13" (1/1) ... [2018-06-24 20:58:13,879 INFO ]: Initial Icfg 20 locations, 30 edges [2018-06-24 20:58:13,880 INFO ]: Using Remove infeasible edges [2018-06-24 20:58:13,881 INFO ]: Using Maximize final states [2018-06-24 20:58:13,881 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:58:13,881 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:58:13,883 INFO ]: Using Remove sink states [2018-06-24 20:58:13,884 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:58:13,884 INFO ]: Using Use SBE [2018-06-24 20:58:13,890 INFO ]: SBE split 0 edges [2018-06-24 20:58:13,895 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:58:13,896 INFO ]: 0 new accepting states [2018-06-24 20:58:13,940 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-24 20:58:13,941 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:58:13,942 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:58:13,942 INFO ]: 0 new accepting states [2018-06-24 20:58:13,943 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:58:13,943 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:58:13,943 INFO ]: Encoded RCFG 15 locations, 25 edges [2018-06-24 20:58:13,944 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:58:13 BasicIcfg [2018-06-24 20:58:13,944 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:58:13,945 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:58:13,945 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:58:13,948 INFO ]: TraceAbstraction initialized [2018-06-24 20:58:13,948 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:58:13" (1/4) ... [2018-06-24 20:58:13,950 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2c25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:58:13, skipping insertion in model container [2018-06-24 20:58:13,950 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:58:13" (2/4) ... [2018-06-24 20:58:13,950 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2c25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:58:13, skipping insertion in model container [2018-06-24 20:58:13,950 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:58:13" (3/4) ... [2018-06-24 20:58:13,950 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe2c25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:58:13, skipping insertion in model container [2018-06-24 20:58:13,950 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:58:13" (4/4) ... [2018-06-24 20:58:13,954 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:58:13,964 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:58:13,971 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:58:14,011 INFO ]: Using default assertion order modulation [2018-06-24 20:58:14,012 INFO ]: Interprodecural is true [2018-06-24 20:58:14,012 INFO ]: Hoare is false [2018-06-24 20:58:14,012 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:58:14,012 INFO ]: Backedges is TWOTRACK [2018-06-24 20:58:14,012 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:58:14,012 INFO ]: Difference is false [2018-06-24 20:58:14,012 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:58:14,012 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:58:14,021 INFO ]: Start isEmpty. Operand 15 states. [2018-06-24 20:58:14,030 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:58:14,030 INFO ]: Found error trace [2018-06-24 20:58:14,031 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:58:14,031 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:14,037 INFO ]: Analyzing trace with hash 34202911, now seen corresponding path program 1 times [2018-06-24 20:58:14,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:14,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:14,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:14,071 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:14,173 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:58:14,174 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:14,174 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:14,176 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:14,189 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:14,189 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:14,191 INFO ]: Start difference. First operand 15 states. Second operand 3 states. [2018-06-24 20:58:14,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:14,403 INFO ]: Finished difference Result 27 states and 47 transitions. [2018-06-24 20:58:14,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:14,405 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:58:14,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:14,418 INFO ]: With dead ends: 27 [2018-06-24 20:58:14,418 INFO ]: Without dead ends: 27 [2018-06-24 20:58:14,421 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:58:14,439 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:58:14,469 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:58:14,470 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:58:14,472 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2018-06-24 20:58:14,473 INFO ]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 5 [2018-06-24 20:58:14,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:14,474 INFO ]: Abstraction has 27 states and 47 transitions. [2018-06-24 20:58:14,474 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:14,474 INFO ]: Start isEmpty. Operand 27 states and 47 transitions. [2018-06-24 20:58:14,476 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:58:14,476 INFO ]: Found error trace [2018-06-24 20:58:14,476 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:14,476 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:14,477 INFO ]: Analyzing trace with hash 1122568561, now seen corresponding path program 1 times [2018-06-24 20:58:14,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:14,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:14,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:14,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,508 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:14,691 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:14,691 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:14,692 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:58:14,693 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:58:14,693 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:58:14,693 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:58:14,694 INFO ]: Start difference. First operand 27 states and 47 transitions. Second operand 5 states. [2018-06-24 20:58:14,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:14,818 INFO ]: Finished difference Result 47 states and 102 transitions. [2018-06-24 20:58:14,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:58:14,818 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-24 20:58:14,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:14,823 INFO ]: With dead ends: 47 [2018-06-24 20:58:14,823 INFO ]: Without dead ends: 47 [2018-06-24 20:58:14,823 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:58:14,824 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:58:14,835 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-06-24 20:58:14,835 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:58:14,837 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 61 transitions. [2018-06-24 20:58:14,837 INFO ]: Start accepts. Automaton has 31 states and 61 transitions. Word has length 11 [2018-06-24 20:58:14,837 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:14,837 INFO ]: Abstraction has 31 states and 61 transitions. [2018-06-24 20:58:14,837 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:58:14,837 INFO ]: Start isEmpty. Operand 31 states and 61 transitions. [2018-06-24 20:58:14,839 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:58:14,839 INFO ]: Found error trace [2018-06-24 20:58:14,839 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:14,839 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:14,839 INFO ]: Analyzing trace with hash 439444241, now seen corresponding path program 1 times [2018-06-24 20:58:14,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:14,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:14,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:14,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:14,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:15,068 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:15,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:15,068 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:58:15,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:15,144 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:15,151 INFO ]: Computing forward predicates... [2018-06-24 20:58:15,176 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:15,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:15,215 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:58:15,215 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:58:15,215 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:58:15,215 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:58:15,215 INFO ]: Start difference. First operand 31 states and 61 transitions. Second operand 6 states. [2018-06-24 20:58:15,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:15,442 INFO ]: Finished difference Result 47 states and 108 transitions. [2018-06-24 20:58:15,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:58:15,442 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-24 20:58:15,443 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:15,444 INFO ]: With dead ends: 47 [2018-06-24 20:58:15,444 INFO ]: Without dead ends: 45 [2018-06-24 20:58:15,444 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:58:15,445 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:58:15,454 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-06-24 20:58:15,454 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:58:15,456 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 69 transitions. [2018-06-24 20:58:15,456 INFO ]: Start accepts. Automaton has 35 states and 69 transitions. Word has length 12 [2018-06-24 20:58:15,456 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:15,456 INFO ]: Abstraction has 35 states and 69 transitions. [2018-06-24 20:58:15,456 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:58:15,456 INFO ]: Start isEmpty. Operand 35 states and 69 transitions. [2018-06-24 20:58:15,458 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:58:15,458 INFO ]: Found error trace [2018-06-24 20:58:15,458 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:15,458 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:15,458 INFO ]: Analyzing trace with hash 439474032, now seen corresponding path program 1 times [2018-06-24 20:58:15,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:15,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:15,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:15,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:15,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:15,478 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:15,581 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:15,581 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:15,581 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:58:15,593 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:15,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:15,635 INFO ]: Computing forward predicates... [2018-06-24 20:58:15,700 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:58:15,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:15,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:58:15,734 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:58:15,734 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:58:15,734 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:58:15,735 INFO ]: Start difference. First operand 35 states and 69 transitions. Second operand 6 states. [2018-06-24 20:58:16,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:16,096 INFO ]: Finished difference Result 53 states and 118 transitions. [2018-06-24 20:58:16,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:58:16,097 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-24 20:58:16,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:16,099 INFO ]: With dead ends: 53 [2018-06-24 20:58:16,099 INFO ]: Without dead ends: 47 [2018-06-24 20:58:16,099 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:58:16,099 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:58:16,107 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-06-24 20:58:16,107 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:58:16,109 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 77 transitions. [2018-06-24 20:58:16,109 INFO ]: Start accepts. Automaton has 37 states and 77 transitions. Word has length 12 [2018-06-24 20:58:16,109 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:16,109 INFO ]: Abstraction has 37 states and 77 transitions. [2018-06-24 20:58:16,109 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:58:16,109 INFO ]: Start isEmpty. Operand 37 states and 77 transitions. [2018-06-24 20:58:16,111 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:16,111 INFO ]: Found error trace [2018-06-24 20:58:16,111 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:16,111 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:16,111 INFO ]: Analyzing trace with hash -1853891174, now seen corresponding path program 1 times [2018-06-24 20:58:16,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:16,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:16,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:16,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:16,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:16,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:16,423 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:16,423 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:16,423 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:58:16,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:16,462 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:16,464 INFO ]: Computing forward predicates... [2018-06-24 20:58:16,496 INFO ]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:16,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:16,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:58:16,515 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:58:16,515 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:58:16,516 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:58:16,516 INFO ]: Start difference. First operand 37 states and 77 transitions. Second operand 10 states. [2018-06-24 20:58:16,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:16,818 INFO ]: Finished difference Result 69 states and 148 transitions. [2018-06-24 20:58:16,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:58:16,819 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-24 20:58:16,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:16,821 INFO ]: With dead ends: 69 [2018-06-24 20:58:16,821 INFO ]: Without dead ends: 69 [2018-06-24 20:58:16,822 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:58:16,822 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-24 20:58:16,836 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 45. [2018-06-24 20:58:16,836 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:58:16,838 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 93 transitions. [2018-06-24 20:58:16,838 INFO ]: Start accepts. Automaton has 45 states and 93 transitions. Word has length 17 [2018-06-24 20:58:16,838 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:16,838 INFO ]: Abstraction has 45 states and 93 transitions. [2018-06-24 20:58:16,838 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:58:16,838 INFO ]: Start isEmpty. Operand 45 states and 93 transitions. [2018-06-24 20:58:16,840 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:16,840 INFO ]: Found error trace [2018-06-24 20:58:16,840 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:16,841 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:16,841 INFO ]: Analyzing trace with hash -1953801823, now seen corresponding path program 1 times [2018-06-24 20:58:16,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:16,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:16,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:16,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:16,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:16,855 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:16,905 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:16,905 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:16,905 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:58:16,905 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:58:16,905 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:58:16,905 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:58:16,905 INFO ]: Start difference. First operand 45 states and 93 transitions. Second operand 5 states. [2018-06-24 20:58:16,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:16,991 INFO ]: Finished difference Result 57 states and 120 transitions. [2018-06-24 20:58:16,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:58:16,993 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-24 20:58:16,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:16,995 INFO ]: With dead ends: 57 [2018-06-24 20:58:16,995 INFO ]: Without dead ends: 57 [2018-06-24 20:58:16,995 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:58:16,995 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:58:17,003 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-06-24 20:58:17,003 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:58:17,005 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 93 transitions. [2018-06-24 20:58:17,006 INFO ]: Start accepts. Automaton has 47 states and 93 transitions. Word has length 17 [2018-06-24 20:58:17,006 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:17,006 INFO ]: Abstraction has 47 states and 93 transitions. [2018-06-24 20:58:17,006 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:58:17,006 INFO ]: Start isEmpty. Operand 47 states and 93 transitions. [2018-06-24 20:58:17,008 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:58:17,008 INFO ]: Found error trace [2018-06-24 20:58:17,008 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:17,008 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:17,008 INFO ]: Analyzing trace with hash 305241119, now seen corresponding path program 1 times [2018-06-24 20:58:17,008 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:17,008 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:17,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:17,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,022 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:17,071 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:17,071 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:17,071 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:58:17,071 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:58:17,071 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:58:17,071 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:58:17,071 INFO ]: Start difference. First operand 47 states and 93 transitions. Second operand 5 states. [2018-06-24 20:58:17,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:17,179 INFO ]: Finished difference Result 60 states and 128 transitions. [2018-06-24 20:58:17,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:58:17,180 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-24 20:58:17,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:17,181 INFO ]: With dead ends: 60 [2018-06-24 20:58:17,181 INFO ]: Without dead ends: 60 [2018-06-24 20:58:17,181 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:58:17,182 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 20:58:17,198 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-06-24 20:58:17,198 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 20:58:17,199 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 97 transitions. [2018-06-24 20:58:17,199 INFO ]: Start accepts. Automaton has 49 states and 97 transitions. Word has length 17 [2018-06-24 20:58:17,199 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:17,199 INFO ]: Abstraction has 49 states and 97 transitions. [2018-06-24 20:58:17,199 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:58:17,199 INFO ]: Start isEmpty. Operand 49 states and 97 transitions. [2018-06-24 20:58:17,201 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:58:17,201 INFO ]: Found error trace [2018-06-24 20:58:17,201 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:17,201 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:17,201 INFO ]: Analyzing trace with hash -1636434746, now seen corresponding path program 1 times [2018-06-24 20:58:17,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:17,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:17,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:17,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:17,258 INFO ]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:58:17,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:17,258 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:17,258 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:17,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:17,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:17,258 INFO ]: Start difference. First operand 49 states and 97 transitions. Second operand 3 states. [2018-06-24 20:58:17,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:17,283 INFO ]: Finished difference Result 55 states and 107 transitions. [2018-06-24 20:58:17,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:17,283 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 20:58:17,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:17,284 INFO ]: With dead ends: 55 [2018-06-24 20:58:17,284 INFO ]: Without dead ends: 47 [2018-06-24 20:58:17,284 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:58:17,284 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:58:17,289 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-24 20:58:17,289 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:58:17,290 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2018-06-24 20:58:17,290 INFO ]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 18 [2018-06-24 20:58:17,290 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:17,290 INFO ]: Abstraction has 47 states and 87 transitions. [2018-06-24 20:58:17,290 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:17,290 INFO ]: Start isEmpty. Operand 47 states and 87 transitions. [2018-06-24 20:58:17,291 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:58:17,291 INFO ]: Found error trace [2018-06-24 20:58:17,291 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:17,291 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:17,292 INFO ]: Analyzing trace with hash -438727360, now seen corresponding path program 1 times [2018-06-24 20:58:17,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:17,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:17,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,292 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:17,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,305 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:17,340 INFO ]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:17,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:17,340 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) [2018-06-24 20:58:17,355 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:17,395 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:17,397 INFO ]: Computing forward predicates... [2018-06-24 20:58:17,544 INFO ]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:58:17,572 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:58:17,572 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 9 [2018-06-24 20:58:17,572 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:58:17,572 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:58:17,572 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:58:17,572 INFO ]: Start difference. First operand 47 states and 87 transitions. Second operand 9 states. [2018-06-24 20:58:17,874 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:17,874 INFO ]: Finished difference Result 59 states and 103 transitions. [2018-06-24 20:58:17,874 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:58:17,874 INFO ]: Start accepts. Automaton has 9 states. Word has length 18 [2018-06-24 20:58:17,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:17,875 INFO ]: With dead ends: 59 [2018-06-24 20:58:17,875 INFO ]: Without dead ends: 55 [2018-06-24 20:58:17,875 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:58:17,875 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:58:17,880 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-06-24 20:58:17,880 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:58:17,881 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 79 transitions. [2018-06-24 20:58:17,881 INFO ]: Start accepts. Automaton has 43 states and 79 transitions. Word has length 18 [2018-06-24 20:58:17,881 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:17,881 INFO ]: Abstraction has 43 states and 79 transitions. [2018-06-24 20:58:17,881 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:58:17,881 INFO ]: Start isEmpty. Operand 43 states and 79 transitions. [2018-06-24 20:58:17,882 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:58:17,882 INFO ]: Found error trace [2018-06-24 20:58:17,882 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:17,882 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:17,882 INFO ]: Analyzing trace with hash 872097315, now seen corresponding path program 1 times [2018-06-24 20:58:17,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:17,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:17,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:17,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:17,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:17,972 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 20:58:17,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:17,972 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:58:17,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:18,029 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:18,031 INFO ]: Computing forward predicates... [2018-06-24 20:58:18,173 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 20:58:18,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:18,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 20:58:18,192 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:58:18,192 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:58:18,192 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:58:18,192 INFO ]: Start difference. First operand 43 states and 79 transitions. Second operand 15 states. [2018-06-24 20:58:19,688 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:19,688 INFO ]: Finished difference Result 122 states and 331 transitions. [2018-06-24 20:58:19,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:58:19,689 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-24 20:58:19,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:19,692 INFO ]: With dead ends: 122 [2018-06-24 20:58:19,692 INFO ]: Without dead ends: 113 [2018-06-24 20:58:19,693 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:58:19,693 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 20:58:19,718 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 83. [2018-06-24 20:58:19,718 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-24 20:58:19,720 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 175 transitions. [2018-06-24 20:58:19,720 INFO ]: Start accepts. Automaton has 83 states and 175 transitions. Word has length 18 [2018-06-24 20:58:19,720 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:19,720 INFO ]: Abstraction has 83 states and 175 transitions. [2018-06-24 20:58:19,720 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:58:19,720 INFO ]: Start isEmpty. Operand 83 states and 175 transitions. [2018-06-24 20:58:19,722 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:58:19,722 INFO ]: Found error trace [2018-06-24 20:58:19,722 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:19,723 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:19,723 INFO ]: Analyzing trace with hash 872127106, now seen corresponding path program 1 times [2018-06-24 20:58:19,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:19,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:19,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:19,723 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:19,723 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:19,734 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:19,768 INFO ]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:58:19,768 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:19,768 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:58:19,768 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:58:19,768 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:58:19,768 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:58:19,768 INFO ]: Start difference. First operand 83 states and 175 transitions. Second operand 3 states. [2018-06-24 20:58:19,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:19,778 INFO ]: Finished difference Result 85 states and 177 transitions. [2018-06-24 20:58:19,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:58:19,778 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 20:58:19,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:19,779 INFO ]: With dead ends: 85 [2018-06-24 20:58:19,779 INFO ]: Without dead ends: 67 [2018-06-24 20:58:19,779 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:58:19,780 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:58:19,786 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-24 20:58:19,786 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:58:19,787 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2018-06-24 20:58:19,787 INFO ]: Start accepts. Automaton has 67 states and 124 transitions. Word has length 18 [2018-06-24 20:58:19,787 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:19,787 INFO ]: Abstraction has 67 states and 124 transitions. [2018-06-24 20:58:19,787 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:58:19,787 INFO ]: Start isEmpty. Operand 67 states and 124 transitions. [2018-06-24 20:58:19,790 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:58:19,790 INFO ]: Found error trace [2018-06-24 20:58:19,790 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:19,790 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:19,790 INFO ]: Analyzing trace with hash 965160707, now seen corresponding path program 2 times [2018-06-24 20:58:19,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:19,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:19,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:19,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:19,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:19,803 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:20,073 INFO ]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 20:58:20,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:58:20,073 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-24 20:58:20,073 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:58:20,073 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:58:20,073 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:58:20,074 INFO ]: Start difference. First operand 67 states and 124 transitions. Second operand 7 states. [2018-06-24 20:58:20,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:20,210 INFO ]: Finished difference Result 83 states and 150 transitions. [2018-06-24 20:58:20,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:58:20,210 INFO ]: Start accepts. Automaton has 7 states. Word has length 23 [2018-06-24 20:58:20,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:20,211 INFO ]: With dead ends: 83 [2018-06-24 20:58:20,211 INFO ]: Without dead ends: 61 [2018-06-24 20:58:20,212 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:58:20,212 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:58:20,217 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 43. [2018-06-24 20:58:20,217 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-24 20:58:20,218 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 76 transitions. [2018-06-24 20:58:20,218 INFO ]: Start accepts. Automaton has 43 states and 76 transitions. Word has length 23 [2018-06-24 20:58:20,218 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:20,218 INFO ]: Abstraction has 43 states and 76 transitions. [2018-06-24 20:58:20,218 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:58:20,218 INFO ]: Start isEmpty. Operand 43 states and 76 transitions. [2018-06-24 20:58:20,220 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:20,220 INFO ]: Found error trace [2018-06-24 20:58:20,220 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:20,220 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:20,220 INFO ]: Analyzing trace with hash 1961322440, now seen corresponding path program 1 times [2018-06-24 20:58:20,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:20,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:20,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:20,221 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:20,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:20,239 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:20,520 INFO ]: Checked inductivity of 30 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:58:20,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:20,520 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:58:20,537 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:20,584 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:20,588 INFO ]: Computing forward predicates... [2018-06-24 20:58:20,722 INFO ]: Checked inductivity of 30 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:58:20,742 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:20,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-06-24 20:58:20,743 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:58:20,743 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:58:20,744 INFO ]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:58:20,744 INFO ]: Start difference. First operand 43 states and 76 transitions. Second operand 17 states. [2018-06-24 20:58:22,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:22,333 INFO ]: Finished difference Result 124 states and 269 transitions. [2018-06-24 20:58:22,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:58:22,333 INFO ]: Start accepts. Automaton has 17 states. Word has length 25 [2018-06-24 20:58:22,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:22,335 INFO ]: With dead ends: 124 [2018-06-24 20:58:22,335 INFO ]: Without dead ends: 124 [2018-06-24 20:58:22,336 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:58:22,336 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-24 20:58:22,348 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-06-24 20:58:22,348 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-24 20:58:22,350 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 224 transitions. [2018-06-24 20:58:22,350 INFO ]: Start accepts. Automaton has 108 states and 224 transitions. Word has length 25 [2018-06-24 20:58:22,350 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:22,350 INFO ]: Abstraction has 108 states and 224 transitions. [2018-06-24 20:58:22,350 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:58:22,350 INFO ]: Start isEmpty. Operand 108 states and 224 transitions. [2018-06-24 20:58:22,352 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:58:22,352 INFO ]: Found error trace [2018-06-24 20:58:22,352 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:22,352 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:22,352 INFO ]: Analyzing trace with hash 308296099, now seen corresponding path program 2 times [2018-06-24 20:58:22,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:22,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:22,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:22,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:22,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:22,367 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:22,513 INFO ]: Checked inductivity of 32 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:22,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:22,514 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) [2018-06-24 20:58:22,530 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:22,577 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:22,577 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:22,580 INFO ]: Computing forward predicates... [2018-06-24 20:58:22,715 INFO ]: Checked inductivity of 32 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 20:58:22,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:22,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-24 20:58:22,761 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:58:22,761 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:58:22,761 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:58:22,761 INFO ]: Start difference. First operand 108 states and 224 transitions. Second operand 19 states. [2018-06-24 20:58:24,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:24,824 INFO ]: Finished difference Result 142 states and 296 transitions. [2018-06-24 20:58:24,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:58:24,824 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-24 20:58:24,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:24,826 INFO ]: With dead ends: 142 [2018-06-24 20:58:24,826 INFO ]: Without dead ends: 141 [2018-06-24 20:58:24,826 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:58:24,827 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-24 20:58:24,838 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 107. [2018-06-24 20:58:24,838 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-24 20:58:24,840 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 217 transitions. [2018-06-24 20:58:24,840 INFO ]: Start accepts. Automaton has 107 states and 217 transitions. Word has length 25 [2018-06-24 20:58:24,840 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:24,840 INFO ]: Abstraction has 107 states and 217 transitions. [2018-06-24 20:58:24,840 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:58:24,840 INFO ]: Start isEmpty. Operand 107 states and 217 transitions. [2018-06-24 20:58:24,841 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:58:24,841 INFO ]: Found error trace [2018-06-24 20:58:24,841 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:24,841 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:24,842 INFO ]: Analyzing trace with hash 1491962136, now seen corresponding path program 2 times [2018-06-24 20:58:24,842 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:24,842 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:24,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:24,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:24,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:24,863 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:25,020 INFO ]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 20:58:25,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:25,020 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:58:25,026 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:25,066 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:25,067 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:25,071 INFO ]: Computing forward predicates... [2018-06-24 20:58:25,290 INFO ]: Checked inductivity of 43 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 20:58:25,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:25,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:58:25,324 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:58:25,325 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:58:25,325 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:58:25,325 INFO ]: Start difference. First operand 107 states and 217 transitions. Second operand 9 states. [2018-06-24 20:58:25,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:25,597 INFO ]: Finished difference Result 209 states and 442 transitions. [2018-06-24 20:58:25,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:58:25,598 INFO ]: Start accepts. Automaton has 9 states. Word has length 27 [2018-06-24 20:58:25,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:25,602 INFO ]: With dead ends: 209 [2018-06-24 20:58:25,602 INFO ]: Without dead ends: 203 [2018-06-24 20:58:25,603 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:58:25,607 INFO ]: Start minimizeSevpa. Operand 203 states. [2018-06-24 20:58:25,628 INFO ]: Finished minimizeSevpa. Reduced states from 203 to 125. [2018-06-24 20:58:25,628 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-24 20:58:25,631 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 256 transitions. [2018-06-24 20:58:25,631 INFO ]: Start accepts. Automaton has 125 states and 256 transitions. Word has length 27 [2018-06-24 20:58:25,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:25,632 INFO ]: Abstraction has 125 states and 256 transitions. [2018-06-24 20:58:25,632 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:58:25,632 INFO ]: Start isEmpty. Operand 125 states and 256 transitions. [2018-06-24 20:58:25,633 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:58:25,633 INFO ]: Found error trace [2018-06-24 20:58:25,633 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:25,633 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:25,633 INFO ]: Analyzing trace with hash -257427969, now seen corresponding path program 3 times [2018-06-24 20:58:25,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:25,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:25,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:25,634 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:25,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:25,653 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:26,254 INFO ]: Checked inductivity of 45 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:26,254 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:26,254 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:58:26,264 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:26,306 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:58:26,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:26,309 INFO ]: Computing forward predicates... [2018-06-24 20:58:26,328 INFO ]: Checked inductivity of 45 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:26,347 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:26,347 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:58:26,348 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:58:26,348 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:58:26,348 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:58:26,348 INFO ]: Start difference. First operand 125 states and 256 transitions. Second operand 10 states. [2018-06-24 20:58:26,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:26,447 INFO ]: Finished difference Result 191 states and 452 transitions. [2018-06-24 20:58:26,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:58:26,448 INFO ]: Start accepts. Automaton has 10 states. Word has length 27 [2018-06-24 20:58:26,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:26,453 INFO ]: With dead ends: 191 [2018-06-24 20:58:26,453 INFO ]: Without dead ends: 191 [2018-06-24 20:58:26,453 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:58:26,453 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-24 20:58:26,467 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 146. [2018-06-24 20:58:26,468 INFO ]: Start removeUnreachable. Operand 146 states. [2018-06-24 20:58:26,470 INFO ]: Finished removeUnreachable. Reduced from 146 states to 146 states and 304 transitions. [2018-06-24 20:58:26,470 INFO ]: Start accepts. Automaton has 146 states and 304 transitions. Word has length 27 [2018-06-24 20:58:26,470 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:26,470 INFO ]: Abstraction has 146 states and 304 transitions. [2018-06-24 20:58:26,470 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:58:26,470 INFO ]: Start isEmpty. Operand 146 states and 304 transitions. [2018-06-24 20:58:26,471 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:58:26,471 INFO ]: Found error trace [2018-06-24 20:58:26,472 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:26,472 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:26,472 INFO ]: Analyzing trace with hash 609224771, now seen corresponding path program 4 times [2018-06-24 20:58:26,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:26,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:26,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:26,472 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:26,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:26,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:26,724 INFO ]: Checked inductivity of 53 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:26,724 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:26,724 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:58:26,730 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:26,800 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:26,800 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:26,804 INFO ]: Computing forward predicates... [2018-06-24 20:58:26,817 INFO ]: Checked inductivity of 53 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:58:26,850 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:26,850 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:58:26,851 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:58:26,851 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:58:26,851 INFO ]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:58:26,851 INFO ]: Start difference. First operand 146 states and 304 transitions. Second operand 11 states. [2018-06-24 20:58:27,878 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 20:58:28,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:28,038 INFO ]: Finished difference Result 203 states and 424 transitions. [2018-06-24 20:58:28,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:58:28,038 INFO ]: Start accepts. Automaton has 11 states. Word has length 28 [2018-06-24 20:58:28,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:28,043 INFO ]: With dead ends: 203 [2018-06-24 20:58:28,043 INFO ]: Without dead ends: 194 [2018-06-24 20:58:28,044 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:58:28,044 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-24 20:58:28,058 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 164. [2018-06-24 20:58:28,058 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-24 20:58:28,062 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 343 transitions. [2018-06-24 20:58:28,062 INFO ]: Start accepts. Automaton has 164 states and 343 transitions. Word has length 28 [2018-06-24 20:58:28,062 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:28,062 INFO ]: Abstraction has 164 states and 343 transitions. [2018-06-24 20:58:28,062 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:58:28,062 INFO ]: Start isEmpty. Operand 164 states and 343 transitions. [2018-06-24 20:58:28,064 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:58:28,064 INFO ]: Found error trace [2018-06-24 20:58:28,064 INFO ]: trace histogram [5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:28,064 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:28,064 INFO ]: Analyzing trace with hash -146870241, now seen corresponding path program 3 times [2018-06-24 20:58:28,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:28,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:28,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:28,065 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:28,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:28,086 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:28,436 INFO ]: Checked inductivity of 73 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-24 20:58:28,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:28,436 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:58:28,443 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:28,500 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:58:28,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:28,504 INFO ]: Computing forward predicates... [2018-06-24 20:58:28,626 INFO ]: Checked inductivity of 73 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:58:28,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:28,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 18 [2018-06-24 20:58:28,654 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:58:28,654 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:58:28,654 INFO ]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:58:28,654 INFO ]: Start difference. First operand 164 states and 343 transitions. Second operand 18 states. [2018-06-24 20:58:29,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:29,475 INFO ]: Finished difference Result 271 states and 661 transitions. [2018-06-24 20:58:29,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:58:29,475 INFO ]: Start accepts. Automaton has 18 states. Word has length 34 [2018-06-24 20:58:29,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:29,479 INFO ]: With dead ends: 271 [2018-06-24 20:58:29,479 INFO ]: Without dead ends: 226 [2018-06-24 20:58:29,480 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:58:29,480 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-24 20:58:29,501 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 166. [2018-06-24 20:58:29,501 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-24 20:58:29,503 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 375 transitions. [2018-06-24 20:58:29,503 INFO ]: Start accepts. Automaton has 166 states and 375 transitions. Word has length 34 [2018-06-24 20:58:29,503 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:29,503 INFO ]: Abstraction has 166 states and 375 transitions. [2018-06-24 20:58:29,503 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:58:29,503 INFO ]: Start isEmpty. Operand 166 states and 375 transitions. [2018-06-24 20:58:29,505 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:58:29,505 INFO ]: Found error trace [2018-06-24 20:58:29,505 INFO ]: trace histogram [6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:29,505 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:29,505 INFO ]: Analyzing trace with hash 1345028636, now seen corresponding path program 4 times [2018-06-24 20:58:29,505 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:29,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:29,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:29,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:29,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:29,527 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:29,718 INFO ]: Checked inductivity of 83 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:58:29,718 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:29,718 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:29,724 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:58:29,775 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:58:29,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:29,778 INFO ]: Computing forward predicates... [2018-06-24 20:58:29,954 INFO ]: Checked inductivity of 83 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 20:58:29,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:29,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2018-06-24 20:58:29,974 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:58:29,975 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:58:29,975 INFO ]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:58:29,975 INFO ]: Start difference. First operand 166 states and 375 transitions. Second operand 22 states. [2018-06-24 20:58:31,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:31,276 INFO ]: Finished difference Result 301 states and 645 transitions. [2018-06-24 20:58:31,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 20:58:31,276 INFO ]: Start accepts. Automaton has 22 states. Word has length 35 [2018-06-24 20:58:31,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:31,278 INFO ]: With dead ends: 301 [2018-06-24 20:58:31,278 INFO ]: Without dead ends: 166 [2018-06-24 20:58:31,279 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=2963, Unknown=0, NotChecked=0, Total=3422 [2018-06-24 20:58:31,279 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-24 20:58:31,290 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-06-24 20:58:31,290 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-24 20:58:31,293 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 372 transitions. [2018-06-24 20:58:31,293 INFO ]: Start accepts. Automaton has 166 states and 372 transitions. Word has length 35 [2018-06-24 20:58:31,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:31,293 INFO ]: Abstraction has 166 states and 372 transitions. [2018-06-24 20:58:31,293 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:58:31,293 INFO ]: Start isEmpty. Operand 166 states and 372 transitions. [2018-06-24 20:58:31,294 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:58:31,294 INFO ]: Found error trace [2018-06-24 20:58:31,295 INFO ]: trace histogram [7, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:31,295 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:31,295 INFO ]: Analyzing trace with hash 1978186606, now seen corresponding path program 5 times [2018-06-24 20:58:31,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:31,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:31,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:31,295 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:31,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:31,321 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:32,130 WARN ]: Spent 344.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-06-24 20:58:32,195 INFO ]: Checked inductivity of 94 backedges. 35 proven. 34 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 20:58:32,195 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:32,195 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:58:32,200 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:58:32,303 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:58:32,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:32,308 INFO ]: Computing forward predicates... [2018-06-24 20:58:32,795 INFO ]: Checked inductivity of 94 backedges. 51 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-24 20:58:32,816 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:32,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-06-24 20:58:32,817 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:58:32,817 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:58:32,817 INFO ]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:58:32,817 INFO ]: Start difference. First operand 166 states and 372 transitions. Second operand 21 states. [2018-06-24 20:58:34,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:34,440 INFO ]: Finished difference Result 330 states and 779 transitions. [2018-06-24 20:58:34,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:58:34,440 INFO ]: Start accepts. Automaton has 21 states. Word has length 36 [2018-06-24 20:58:34,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:34,445 INFO ]: With dead ends: 330 [2018-06-24 20:58:34,445 INFO ]: Without dead ends: 330 [2018-06-24 20:58:34,445 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:58:34,446 INFO ]: Start minimizeSevpa. Operand 330 states. [2018-06-24 20:58:34,469 INFO ]: Finished minimizeSevpa. Reduced states from 330 to 301. [2018-06-24 20:58:34,469 INFO ]: Start removeUnreachable. Operand 301 states. [2018-06-24 20:58:34,474 INFO ]: Finished removeUnreachable. Reduced from 301 states to 301 states and 664 transitions. [2018-06-24 20:58:34,474 INFO ]: Start accepts. Automaton has 301 states and 664 transitions. Word has length 36 [2018-06-24 20:58:34,474 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:34,474 INFO ]: Abstraction has 301 states and 664 transitions. [2018-06-24 20:58:34,474 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:58:34,474 INFO ]: Start isEmpty. Operand 301 states and 664 transitions. [2018-06-24 20:58:34,477 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:58:34,477 INFO ]: Found error trace [2018-06-24 20:58:34,477 INFO ]: trace histogram [7, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:34,477 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:34,477 INFO ]: Analyzing trace with hash 1547129173, now seen corresponding path program 5 times [2018-06-24 20:58:34,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:34,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:34,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:34,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:34,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:34,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:34,779 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:58:35,265 WARN ]: Spent 223.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-24 20:58:35,348 INFO ]: Checked inductivity of 98 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-24 20:58:35,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:35,348 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:58:35,364 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:58:35,421 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:58:35,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:35,424 INFO ]: Computing forward predicates... [2018-06-24 20:58:35,619 INFO ]: Checked inductivity of 98 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-24 20:58:35,638 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:35,638 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-06-24 20:58:35,638 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:58:35,638 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:58:35,639 INFO ]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:58:35,639 INFO ]: Start difference. First operand 301 states and 664 transitions. Second operand 27 states. [2018-06-24 20:58:40,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:40,055 INFO ]: Finished difference Result 561 states and 1697 transitions. [2018-06-24 20:58:40,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 20:58:40,062 INFO ]: Start accepts. Automaton has 27 states. Word has length 36 [2018-06-24 20:58:40,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:40,070 INFO ]: With dead ends: 561 [2018-06-24 20:58:40,070 INFO ]: Without dead ends: 448 [2018-06-24 20:58:40,072 INFO ]: 0 DeclaredPredicates, 124 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=844, Invalid=6638, Unknown=0, NotChecked=0, Total=7482 [2018-06-24 20:58:40,073 INFO ]: Start minimizeSevpa. Operand 448 states. [2018-06-24 20:58:40,116 INFO ]: Finished minimizeSevpa. Reduced states from 448 to 370. [2018-06-24 20:58:40,116 INFO ]: Start removeUnreachable. Operand 370 states. [2018-06-24 20:58:40,129 INFO ]: Finished removeUnreachable. Reduced from 370 states to 370 states and 877 transitions. [2018-06-24 20:58:40,129 INFO ]: Start accepts. Automaton has 370 states and 877 transitions. Word has length 36 [2018-06-24 20:58:40,129 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:40,129 INFO ]: Abstraction has 370 states and 877 transitions. [2018-06-24 20:58:40,129 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:58:40,129 INFO ]: Start isEmpty. Operand 370 states and 877 transitions. [2018-06-24 20:58:40,132 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:58:40,132 INFO ]: Found error trace [2018-06-24 20:58:40,132 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:40,132 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:40,133 INFO ]: Analyzing trace with hash -41280655, now seen corresponding path program 6 times [2018-06-24 20:58:40,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:40,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:40,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:40,133 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:40,133 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:40,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:40,822 WARN ]: Spent 203.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-06-24 20:58:40,876 INFO ]: Checked inductivity of 133 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 20:58:40,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:40,876 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:58:40,885 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:58:40,958 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:58:40,958 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:40,961 INFO ]: Computing forward predicates... [2018-06-24 20:58:41,123 INFO ]: Checked inductivity of 133 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-24 20:58:41,142 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:41,142 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-06-24 20:58:41,143 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:58:41,143 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:58:41,143 INFO ]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:58:41,143 INFO ]: Start difference. First operand 370 states and 877 transitions. Second operand 20 states. [2018-06-24 20:58:43,447 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:58:43,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:43,741 INFO ]: Finished difference Result 853 states and 2265 transitions. [2018-06-24 20:58:43,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:58:43,741 INFO ]: Start accepts. Automaton has 20 states. Word has length 39 [2018-06-24 20:58:43,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:43,767 INFO ]: With dead ends: 853 [2018-06-24 20:58:43,767 INFO ]: Without dead ends: 823 [2018-06-24 20:58:43,768 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:58:43,768 INFO ]: Start minimizeSevpa. Operand 823 states. [2018-06-24 20:58:43,851 INFO ]: Finished minimizeSevpa. Reduced states from 823 to 589. [2018-06-24 20:58:43,851 INFO ]: Start removeUnreachable. Operand 589 states. [2018-06-24 20:58:43,863 INFO ]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1373 transitions. [2018-06-24 20:58:43,863 INFO ]: Start accepts. Automaton has 589 states and 1373 transitions. Word has length 39 [2018-06-24 20:58:43,863 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:43,863 INFO ]: Abstraction has 589 states and 1373 transitions. [2018-06-24 20:58:43,863 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:58:43,863 INFO ]: Start isEmpty. Operand 589 states and 1373 transitions. [2018-06-24 20:58:43,865 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:58:43,866 INFO ]: Found error trace [2018-06-24 20:58:43,866 INFO ]: trace histogram [10, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:43,866 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:43,866 INFO ]: Analyzing trace with hash -1456630794, now seen corresponding path program 7 times [2018-06-24 20:58:43,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:43,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:43,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,866 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:43,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:43,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:44,390 INFO ]: Checked inductivity of 133 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-24 20:58:44,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:44,390 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:58:44,397 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:44,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:44,468 INFO ]: Computing forward predicates... [2018-06-24 20:58:44,564 INFO ]: Checked inductivity of 133 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-24 20:58:44,583 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:44,583 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:58:44,583 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:58:44,583 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:58:44,583 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:58:44,583 INFO ]: Start difference. First operand 589 states and 1373 transitions. Second operand 11 states. [2018-06-24 20:58:44,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:44,778 INFO ]: Finished difference Result 999 states and 2438 transitions. [2018-06-24 20:58:44,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:58:44,779 INFO ]: Start accepts. Automaton has 11 states. Word has length 39 [2018-06-24 20:58:44,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:44,809 INFO ]: With dead ends: 999 [2018-06-24 20:58:44,810 INFO ]: Without dead ends: 954 [2018-06-24 20:58:44,810 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:58:44,810 INFO ]: Start minimizeSevpa. Operand 954 states. [2018-06-24 20:58:44,885 INFO ]: Finished minimizeSevpa. Reduced states from 954 to 604. [2018-06-24 20:58:44,885 INFO ]: Start removeUnreachable. Operand 604 states. [2018-06-24 20:58:44,895 INFO ]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1403 transitions. [2018-06-24 20:58:44,895 INFO ]: Start accepts. Automaton has 604 states and 1403 transitions. Word has length 39 [2018-06-24 20:58:44,895 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:44,895 INFO ]: Abstraction has 604 states and 1403 transitions. [2018-06-24 20:58:44,895 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:58:44,895 INFO ]: Start isEmpty. Operand 604 states and 1403 transitions. [2018-06-24 20:58:44,898 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:58:44,898 INFO ]: Found error trace [2018-06-24 20:58:44,898 INFO ]: trace histogram [11, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:44,898 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:44,898 INFO ]: Analyzing trace with hash 1147336653, now seen corresponding path program 6 times [2018-06-24 20:58:44,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:44,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:44,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:44,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:44,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:44,921 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:45,448 INFO ]: Checked inductivity of 152 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-24 20:58:45,448 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:45,448 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:58:45,459 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:58:45,527 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:58:45,527 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:45,530 INFO ]: Computing forward predicates... [2018-06-24 20:58:45,676 INFO ]: Checked inductivity of 152 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-24 20:58:45,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:45,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-06-24 20:58:45,696 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:58:45,696 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:58:45,696 INFO ]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:58:45,696 INFO ]: Start difference. First operand 604 states and 1403 transitions. Second operand 28 states. [2018-06-24 20:58:48,151 WARN ]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-24 20:58:52,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:52,226 INFO ]: Finished difference Result 1934 states and 7503 transitions. [2018-06-24 20:58:52,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-06-24 20:58:52,226 INFO ]: Start accepts. Automaton has 28 states. Word has length 40 [2018-06-24 20:58:52,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:52,375 INFO ]: With dead ends: 1934 [2018-06-24 20:58:52,375 INFO ]: Without dead ends: 1844 [2018-06-24 20:58:52,379 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2121, Invalid=12159, Unknown=0, NotChecked=0, Total=14280 [2018-06-24 20:58:52,380 INFO ]: Start minimizeSevpa. Operand 1844 states. [2018-06-24 20:58:52,697 INFO ]: Finished minimizeSevpa. Reduced states from 1844 to 944. [2018-06-24 20:58:52,697 INFO ]: Start removeUnreachable. Operand 944 states. [2018-06-24 20:58:52,717 INFO ]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2158 transitions. [2018-06-24 20:58:52,717 INFO ]: Start accepts. Automaton has 944 states and 2158 transitions. Word has length 40 [2018-06-24 20:58:52,717 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:52,717 INFO ]: Abstraction has 944 states and 2158 transitions. [2018-06-24 20:58:52,717 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:58:52,717 INFO ]: Start isEmpty. Operand 944 states and 2158 transitions. [2018-06-24 20:58:52,722 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-24 20:58:52,722 INFO ]: Found error trace [2018-06-24 20:58:52,722 INFO ]: trace histogram [13, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:52,722 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:52,723 INFO ]: Analyzing trace with hash 948363363, now seen corresponding path program 7 times [2018-06-24 20:58:52,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:52,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:52,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:52,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:52,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:52,750 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:53,030 INFO ]: Checked inductivity of 185 backedges. 81 proven. 76 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:58:53,030 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:53,074 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:58:53,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:53,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:53,151 INFO ]: Computing forward predicates... [2018-06-24 20:58:53,331 INFO ]: Checked inductivity of 185 backedges. 115 proven. 33 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-24 20:58:53,355 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:53,355 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-06-24 20:58:53,355 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:58:53,355 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:58:53,356 INFO ]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:58:53,356 INFO ]: Start difference. First operand 944 states and 2158 transitions. Second operand 25 states. [2018-06-24 20:58:53,906 WARN ]: Spent 174.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-24 20:58:54,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:54,846 INFO ]: Finished difference Result 1629 states and 3863 transitions. [2018-06-24 20:58:54,846 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:58:54,846 INFO ]: Start accepts. Automaton has 25 states. Word has length 42 [2018-06-24 20:58:54,846 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:54,879 INFO ]: With dead ends: 1629 [2018-06-24 20:58:54,879 INFO ]: Without dead ends: 1629 [2018-06-24 20:58:54,879 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=1775, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:58:54,880 INFO ]: Start minimizeSevpa. Operand 1629 states. [2018-06-24 20:58:54,990 INFO ]: Finished minimizeSevpa. Reduced states from 1629 to 1495. [2018-06-24 20:58:54,990 INFO ]: Start removeUnreachable. Operand 1495 states. [2018-06-24 20:58:55,020 INFO ]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 3314 transitions. [2018-06-24 20:58:55,020 INFO ]: Start accepts. Automaton has 1495 states and 3314 transitions. Word has length 42 [2018-06-24 20:58:55,020 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:55,020 INFO ]: Abstraction has 1495 states and 3314 transitions. [2018-06-24 20:58:55,020 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:58:55,020 INFO ]: Start isEmpty. Operand 1495 states and 3314 transitions. [2018-06-24 20:58:55,029 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-24 20:58:55,029 INFO ]: Found error trace [2018-06-24 20:58:55,029 INFO ]: trace histogram [15, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:55,029 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:55,029 INFO ]: Analyzing trace with hash -2060087617, now seen corresponding path program 8 times [2018-06-24 20:58:55,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:55,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:55,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:55,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:58:55,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:55,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:55,197 INFO ]: Checked inductivity of 222 backedges. 71 proven. 15 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-24 20:58:55,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:55,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:58:55,202 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:55,276 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:55,276 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:55,279 INFO ]: Computing forward predicates... [2018-06-24 20:58:55,480 INFO ]: Checked inductivity of 222 backedges. 58 proven. 79 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-24 20:58:55,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:55,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-06-24 20:58:55,513 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:58:55,513 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:58:55,513 INFO ]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:58:55,514 INFO ]: Start difference. First operand 1495 states and 3314 transitions. Second operand 29 states. [2018-06-24 20:58:56,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:56,113 INFO ]: Finished difference Result 2524 states and 5687 transitions. [2018-06-24 20:58:56,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:58:56,113 INFO ]: Start accepts. Automaton has 29 states. Word has length 44 [2018-06-24 20:58:56,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:56,197 INFO ]: With dead ends: 2524 [2018-06-24 20:58:56,197 INFO ]: Without dead ends: 2468 [2018-06-24 20:58:56,198 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:58:56,199 INFO ]: Start minimizeSevpa. Operand 2468 states. [2018-06-24 20:58:56,363 INFO ]: Finished minimizeSevpa. Reduced states from 2468 to 1600. [2018-06-24 20:58:56,363 INFO ]: Start removeUnreachable. Operand 1600 states. [2018-06-24 20:58:56,487 INFO ]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3566 transitions. [2018-06-24 20:58:56,487 INFO ]: Start accepts. Automaton has 1600 states and 3566 transitions. Word has length 44 [2018-06-24 20:58:56,487 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:56,487 INFO ]: Abstraction has 1600 states and 3566 transitions. [2018-06-24 20:58:56,487 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:58:56,487 INFO ]: Start isEmpty. Operand 1600 states and 3566 transitions. [2018-06-24 20:58:56,493 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 20:58:56,493 INFO ]: Found error trace [2018-06-24 20:58:56,493 INFO ]: trace histogram [12, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:56,493 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:56,493 INFO ]: Analyzing trace with hash -2035709601, now seen corresponding path program 8 times [2018-06-24 20:58:56,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:56,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:56,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:56,494 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:56,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:56,515 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:56,801 INFO ]: Checked inductivity of 197 backedges. 64 proven. 3 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-06-24 20:58:56,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:56,801 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:58:56,808 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:58:56,880 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:58:56,880 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:56,883 INFO ]: Computing forward predicates... [2018-06-24 20:58:57,135 INFO ]: Checked inductivity of 197 backedges. 55 proven. 52 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-24 20:58:57,155 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:57,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2018-06-24 20:58:57,155 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:58:57,155 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:58:57,155 INFO ]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:58:57,156 INFO ]: Start difference. First operand 1600 states and 3566 transitions. Second operand 29 states. [2018-06-24 20:58:58,800 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:58:58,800 INFO ]: Finished difference Result 1887 states and 4666 transitions. [2018-06-24 20:58:58,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 20:58:58,800 INFO ]: Start accepts. Automaton has 29 states. Word has length 47 [2018-06-24 20:58:58,801 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:58:58,836 INFO ]: With dead ends: 1887 [2018-06-24 20:58:58,836 INFO ]: Without dead ends: 1434 [2018-06-24 20:58:58,838 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=735, Invalid=5271, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:58:58,838 INFO ]: Start minimizeSevpa. Operand 1434 states. [2018-06-24 20:58:59,004 INFO ]: Finished minimizeSevpa. Reduced states from 1434 to 1128. [2018-06-24 20:58:59,004 INFO ]: Start removeUnreachable. Operand 1128 states. [2018-06-24 20:58:59,025 INFO ]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2549 transitions. [2018-06-24 20:58:59,025 INFO ]: Start accepts. Automaton has 1128 states and 2549 transitions. Word has length 47 [2018-06-24 20:58:59,025 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:58:59,025 INFO ]: Abstraction has 1128 states and 2549 transitions. [2018-06-24 20:58:59,025 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:58:59,025 INFO ]: Start isEmpty. Operand 1128 states and 2549 transitions. [2018-06-24 20:58:59,027 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 20:58:59,027 INFO ]: Found error trace [2018-06-24 20:58:59,027 INFO ]: trace histogram [16, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:58:59,027 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:58:59,028 INFO ]: Analyzing trace with hash -931911763, now seen corresponding path program 9 times [2018-06-24 20:58:59,028 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:58:59,028 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:58:59,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:59,028 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:58:59,028 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:58:59,055 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:59,310 INFO ]: Checked inductivity of 275 backedges. 85 proven. 102 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-24 20:58:59,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:58:59,310 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:58:59,317 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:58:59,396 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:58:59,396 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:58:59,400 INFO ]: Computing forward predicates... [2018-06-24 20:58:59,632 INFO ]: Checked inductivity of 275 backedges. 135 proven. 24 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-24 20:58:59,651 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:58:59,651 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-24 20:58:59,651 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:58:59,651 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:58:59,652 INFO ]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:58:59,652 INFO ]: Start difference. First operand 1128 states and 2549 transitions. Second operand 28 states. [2018-06-24 20:59:02,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:02,077 INFO ]: Finished difference Result 1723 states and 4226 transitions. [2018-06-24 20:59:02,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 20:59:02,078 INFO ]: Start accepts. Automaton has 28 states. Word has length 51 [2018-06-24 20:59:02,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:02,125 INFO ]: With dead ends: 1723 [2018-06-24 20:59:02,125 INFO ]: Without dead ends: 1686 [2018-06-24 20:59:02,127 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=679, Invalid=6631, Unknown=0, NotChecked=0, Total=7310 [2018-06-24 20:59:02,127 INFO ]: Start minimizeSevpa. Operand 1686 states. [2018-06-24 20:59:02,238 INFO ]: Finished minimizeSevpa. Reduced states from 1686 to 1187. [2018-06-24 20:59:02,238 INFO ]: Start removeUnreachable. Operand 1187 states. [2018-06-24 20:59:02,260 INFO ]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2668 transitions. [2018-06-24 20:59:02,260 INFO ]: Start accepts. Automaton has 1187 states and 2668 transitions. Word has length 51 [2018-06-24 20:59:02,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:02,260 INFO ]: Abstraction has 1187 states and 2668 transitions. [2018-06-24 20:59:02,260 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:59:02,260 INFO ]: Start isEmpty. Operand 1187 states and 2668 transitions. [2018-06-24 20:59:02,262 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-24 20:59:02,262 INFO ]: Found error trace [2018-06-24 20:59:02,262 INFO ]: trace histogram [18, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:02,263 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:02,263 INFO ]: Analyzing trace with hash 2118373208, now seen corresponding path program 10 times [2018-06-24 20:59:02,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:02,263 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:02,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:02,263 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:02,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:02,298 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:02,881 INFO ]: Checked inductivity of 322 backedges. 85 proven. 16 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-24 20:59:02,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:02,881 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:59:02,887 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:59:02,974 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:59:02,974 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:02,979 INFO ]: Computing forward predicates... [2018-06-24 20:59:03,245 INFO ]: Checked inductivity of 322 backedges. 85 proven. 16 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-24 20:59:03,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:03,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:59:03,265 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:03,265 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:03,265 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:03,265 INFO ]: Start difference. First operand 1187 states and 2668 transitions. Second operand 13 states. [2018-06-24 20:59:03,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:03,609 INFO ]: Finished difference Result 2291 states and 5296 transitions. [2018-06-24 20:59:03,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:59:03,609 INFO ]: Start accepts. Automaton has 13 states. Word has length 53 [2018-06-24 20:59:03,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:03,744 INFO ]: With dead ends: 2291 [2018-06-24 20:59:03,744 INFO ]: Without dead ends: 2267 [2018-06-24 20:59:03,744 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:59:03,748 INFO ]: Start minimizeSevpa. Operand 2267 states. [2018-06-24 20:59:03,892 INFO ]: Finished minimizeSevpa. Reduced states from 2267 to 1187. [2018-06-24 20:59:03,892 INFO ]: Start removeUnreachable. Operand 1187 states. [2018-06-24 20:59:03,916 INFO ]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2668 transitions. [2018-06-24 20:59:03,916 INFO ]: Start accepts. Automaton has 1187 states and 2668 transitions. Word has length 53 [2018-06-24 20:59:03,916 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:03,916 INFO ]: Abstraction has 1187 states and 2668 transitions. [2018-06-24 20:59:03,916 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:03,916 INFO ]: Start isEmpty. Operand 1187 states and 2668 transitions. [2018-06-24 20:59:03,918 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-24 20:59:03,918 INFO ]: Found error trace [2018-06-24 20:59:03,919 INFO ]: trace histogram [18, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:03,919 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:03,919 INFO ]: Analyzing trace with hash 1869631679, now seen corresponding path program 9 times [2018-06-24 20:59:03,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:03,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:03,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:03,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:03,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:03,949 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:04,594 INFO ]: Checked inductivity of 328 backedges. 73 proven. 159 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-24 20:59:04,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:04,594 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:59:04,601 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:59:04,719 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:59:04,719 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:04,724 INFO ]: Computing forward predicates... [2018-06-24 20:59:05,100 INFO ]: Checked inductivity of 328 backedges. 159 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-06-24 20:59:05,121 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:05,121 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-24 20:59:05,121 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:59:05,121 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:59:05,122 INFO ]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:59:05,122 INFO ]: Start difference. First operand 1187 states and 2668 transitions. Second operand 36 states. [2018-06-24 20:59:09,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:09,789 INFO ]: Finished difference Result 3547 states and 14964 transitions. [2018-06-24 20:59:09,790 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-06-24 20:59:09,790 INFO ]: Start accepts. Automaton has 36 states. Word has length 53 [2018-06-24 20:59:09,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:10,065 INFO ]: With dead ends: 3547 [2018-06-24 20:59:10,065 INFO ]: Without dead ends: 3343 [2018-06-24 20:59:10,067 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1611, Invalid=8691, Unknown=0, NotChecked=0, Total=10302 [2018-06-24 20:59:10,069 INFO ]: Start minimizeSevpa. Operand 3343 states. Received shutdown request... [2018-06-24 20:59:10,104 WARN ]: Verification canceled [2018-06-24 20:59:10,106 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:59:10,107 WARN ]: Timeout [2018-06-24 20:59:10,107 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:59:10 BasicIcfg [2018-06-24 20:59:10,107 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:59:10,109 INFO ]: Toolchain (without parser) took 56792.09 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 786.4 MB). Free memory was 255.3 MB in the beginning and 409.1 MB in the end (delta: -153.8 MB). Peak memory consumption was 632.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,109 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 300.9 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:59:10,110 INFO ]: ChcToBoogie took 63.09 ms. Allocated memory is still 300.9 MB. Free memory was 255.3 MB in the beginning and 252.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,110 INFO ]: Boogie Preprocessor took 49.06 ms. Allocated memory is still 300.9 MB. Free memory was 252.3 MB in the beginning and 251.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,110 INFO ]: RCFGBuilder took 419.18 ms. Allocated memory is still 300.9 MB. Free memory was 251.3 MB in the beginning and 237.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,111 INFO ]: BlockEncodingV2 took 85.72 ms. Allocated memory is still 300.9 MB. Free memory was 237.4 MB in the beginning and 234.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,111 INFO ]: TraceAbstraction took 56162.56 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 786.4 MB). Free memory was 234.4 MB in the beginning and 409.1 MB in the end (delta: -174.7 MB). Peak memory consumption was 611.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:59:10,116 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 20 locations, 30 edges - StatisticsResult: Encoded RCFG 15 locations, 25 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.05 ms. Allocated memory is still 300.9 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.09 ms. Allocated memory is still 300.9 MB. Free memory was 255.3 MB in the beginning and 252.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 49.06 ms. Allocated memory is still 300.9 MB. Free memory was 252.3 MB in the beginning and 251.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 419.18 ms. Allocated memory is still 300.9 MB. Free memory was 251.3 MB in the beginning and 237.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 85.72 ms. Allocated memory is still 300.9 MB. Free memory was 237.4 MB in the beginning and 234.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56162.56 ms. Allocated memory was 300.9 MB in the beginning and 1.1 GB in the end (delta: 786.4 MB). Free memory was 234.4 MB in the beginning and 409.1 MB in the end (delta: -174.7 MB). Peak memory consumption was 611.7 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. TIMEOUT Result, 56.1s OverallTime, 30 OverallIterations, 18 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1108 SDtfs, 1483 SDslu, 6937 SDs, 0 SdLazy, 26331 SolverSat, 6153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1745 GetRequests, 743 SyntacticMatches, 18 SemanticMatches, 984 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17486 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1600occurred in iteration=26, 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: 1.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 4882 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1572 ConstructedInterpolants, 0 QuantifiedInterpolants, 195068 SizeOfPredicates, 209 NumberOfNonLiveVariables, 12348 ConjunctsInSsa, 709 ConjunctsInUnsatCore, 53 InterpolantComputations, 8 PerfectInterpolantSequences, 4196/5160 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/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-59-10-128.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-59-10-128.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-59-10-128.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/005b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-59-10-128.csv Completed graceful shutdown