java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:48:03,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:48:03,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:48:03,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:48:03,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:48:03,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:48:03,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:48:03,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:48:03,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:48:03,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:48:03,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:48:03,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:48:03,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:48:03,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:48:03,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:48:03,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:48:03,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:48:03,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:48:03,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:48:03,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:48:03,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:48:03,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:48:03,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:48:03,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:48:03,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:48:03,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:48:03,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:48:03,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:48:03,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:48:03,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:48:03,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:48:03,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:48:03,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:48:03,414 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:48:03,415 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:48:03,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:48:03,416 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:48:03,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:48:03,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:48:03,438 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:48:03,438 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:48:03,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:48:03,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:48:03,442 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:48:03,442 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:48:03,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:48:03,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:48:03,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:48:03,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:48:03,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:48:03,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:48:03,443 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:48:03,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:48:03,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:48:03,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:48:03,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:48:03,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:48:03,444 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:48:03,447 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:48:03,447 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:48:03,494 INFO ]: Repository-Root is: /tmp [2018-06-26 17:48:03,509 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:48:03,514 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:48:03,516 INFO ]: Initializing SmtParser... [2018-06-26 17:48:03,516 INFO ]: SmtParser initialized [2018-06-26 17:48:03,516 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-26 17:48:03,518 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:48:03,613 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 unknown [2018-06-26 17:48:03,765 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-26 17:48:03,770 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:48:03,775 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:48:03,775 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:48:03,775 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:48:03,776 INFO ]: ChcToBoogie initialized [2018-06-26 17:48:03,779 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,832 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03 Unit [2018-06-26 17:48:03,832 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:48:03,833 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:48:03,833 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:48:03,833 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:48:03,855 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,855 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,864 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,864 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,867 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,869 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,870 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... [2018-06-26 17:48:03,872 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:48:03,872 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:48:03,872 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:48:03,872 INFO ]: RCFGBuilder initialized [2018-06-26 17:48:03,875 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:48:03,891 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:48:03,892 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:48:03,892 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:48:03,892 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:48:03,892 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:48:03,892 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:48:04,042 INFO ]: Using library mode [2018-06-26 17:48:04,043 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:04 BoogieIcfgContainer [2018-06-26 17:48:04,043 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:48:04,043 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:48:04,043 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:48:04,044 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:48:04,045 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:04" (1/1) ... [2018-06-26 17:48:04,059 INFO ]: Initial Icfg 12 locations, 15 edges [2018-06-26 17:48:04,060 INFO ]: Using Remove infeasible edges [2018-06-26 17:48:04,061 INFO ]: Using Maximize final states [2018-06-26 17:48:04,062 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:48:04,062 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:48:04,064 INFO ]: Using Remove sink states [2018-06-26 17:48:04,064 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:48:04,064 INFO ]: Using Use SBE [2018-06-26 17:48:04,070 INFO ]: SBE split 0 edges [2018-06-26 17:48:04,075 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:48:04,077 INFO ]: 0 new accepting states [2018-06-26 17:48:04,146 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-26 17:48:04,148 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:48:04,150 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:48:04,150 INFO ]: 0 new accepting states [2018-06-26 17:48:04,150 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:48:04,150 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:48:04,150 INFO ]: Encoded RCFG 7 locations, 10 edges [2018-06-26 17:48:04,151 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:48:04 BasicIcfg [2018-06-26 17:48:04,151 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:48:04,152 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:48:04,152 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:48:04,154 INFO ]: TraceAbstraction initialized [2018-06-26 17:48:04,154 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:48:03" (1/4) ... [2018-06-26 17:48:04,168 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf94fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:48:04, skipping insertion in model container [2018-06-26 17:48:04,168 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:03" (2/4) ... [2018-06-26 17:48:04,168 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf94fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:48:04, skipping insertion in model container [2018-06-26 17:48:04,168 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:04" (3/4) ... [2018-06-26 17:48:04,168 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cf94fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:48:04, skipping insertion in model container [2018-06-26 17:48:04,168 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:48:04" (4/4) ... [2018-06-26 17:48:04,171 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:48:04,182 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:48:04,195 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:48:04,257 INFO ]: Using default assertion order modulation [2018-06-26 17:48:04,258 INFO ]: Interprodecural is true [2018-06-26 17:48:04,258 INFO ]: Hoare is false [2018-06-26 17:48:04,259 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:48:04,259 INFO ]: Backedges is TWOTRACK [2018-06-26 17:48:04,259 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:48:04,259 INFO ]: Difference is false [2018-06-26 17:48:04,259 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:48:04,259 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:48:04,272 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 17:48:04,293 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:48:04,293 INFO ]: Found error trace [2018-06-26 17:48:04,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:48:04,294 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:04,298 INFO ]: Analyzing trace with hash 1131330962, now seen corresponding path program 1 times [2018-06-26 17:48:04,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:04,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:04,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:04,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,368 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:04,469 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:04,470 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:04,470 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:48:04,472 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:48:04,481 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:48:04,482 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:04,483 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-26 17:48:04,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:04,609 INFO ]: Finished difference Result 9 states and 14 transitions. [2018-06-26 17:48:04,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:48:04,610 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:48:04,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:04,616 INFO ]: With dead ends: 9 [2018-06-26 17:48:04,616 INFO ]: Without dead ends: 8 [2018-06-26 17:48:04,618 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:04,631 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:48:04,650 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:48:04,652 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:48:04,652 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-26 17:48:04,653 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-26 17:48:04,653 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:04,653 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-26 17:48:04,653 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:48:04,653 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-26 17:48:04,654 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:48:04,654 INFO ]: Found error trace [2018-06-26 17:48:04,654 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:48:04,654 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:04,654 INFO ]: Analyzing trace with hash 1132254483, now seen corresponding path program 1 times [2018-06-26 17:48:04,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:04,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:04,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:04,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,672 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:04,800 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:04,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:04,800 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:48:04,801 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:48:04,801 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:48:04,801 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:04,802 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-06-26 17:48:04,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:04,970 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-26 17:48:04,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:48:04,971 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:48:04,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:04,974 INFO ]: With dead ends: 12 [2018-06-26 17:48:04,974 INFO ]: Without dead ends: 12 [2018-06-26 17:48:04,974 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:04,975 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:48:04,978 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 17:48:04,978 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:48:04,978 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-26 17:48:04,978 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 6 [2018-06-26 17:48:04,978 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:04,979 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-26 17:48:04,979 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:48:04,979 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-26 17:48:04,979 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:04,979 INFO ]: Found error trace [2018-06-26 17:48:04,979 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:04,979 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:04,979 INFO ]: Analyzing trace with hash 711912865, now seen corresponding path program 1 times [2018-06-26 17:48:04,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:04,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:04,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:04,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:04,993 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:05,136 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:05,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:05,136 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:05,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:05,166 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:05,171 INFO ]: Computing forward predicates... [2018-06-26 17:48:05,189 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:05,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:05,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:48:05,210 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:05,210 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:05,210 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:05,211 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-26 17:48:05,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:05,369 INFO ]: Finished difference Result 13 states and 20 transitions. [2018-06-26 17:48:05,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:48:05,371 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:48:05,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:05,371 INFO ]: With dead ends: 13 [2018-06-26 17:48:05,371 INFO ]: Without dead ends: 11 [2018-06-26 17:48:05,371 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:05,371 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:48:05,373 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:48:05,373 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:48:05,373 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-26 17:48:05,373 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2018-06-26 17:48:05,373 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:05,373 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-26 17:48:05,373 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:05,373 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-26 17:48:05,374 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:05,374 INFO ]: Found error trace [2018-06-26 17:48:05,374 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:05,374 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:05,374 INFO ]: Analyzing trace with hash 740005778, now seen corresponding path program 1 times [2018-06-26 17:48:05,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:05,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:05,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:05,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:05,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:05,387 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:05,638 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:05,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:05,638 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:48:05,638 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:05,639 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:05,639 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:05,639 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 5 states. [2018-06-26 17:48:05,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:05,810 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-26 17:48:05,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:48:05,810 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:48:05,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:05,811 INFO ]: With dead ends: 16 [2018-06-26 17:48:05,811 INFO ]: Without dead ends: 14 [2018-06-26 17:48:05,811 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:05,811 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:05,813 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-26 17:48:05,813 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:48:05,813 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-26 17:48:05,813 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2018-06-26 17:48:05,813 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:05,813 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-26 17:48:05,813 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:05,813 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-26 17:48:05,814 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:05,814 INFO ]: Found error trace [2018-06-26 17:48:05,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:05,814 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:05,814 INFO ]: Analyzing trace with hash 740542016, now seen corresponding path program 1 times [2018-06-26 17:48:05,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:05,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:05,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:05,816 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:05,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:05,835 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,000 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,000 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:06,000 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:48:06,001 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:06,001 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:06,001 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:06,001 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2018-06-26 17:48:06,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:06,113 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-26 17:48:06,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:48:06,114 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:48:06,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:06,114 INFO ]: With dead ends: 15 [2018-06-26 17:48:06,114 INFO ]: Without dead ends: 15 [2018-06-26 17:48:06,115 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:06,115 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:48:06,116 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-26 17:48:06,116 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:48:06,116 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-26 17:48:06,116 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 7 [2018-06-26 17:48:06,116 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:06,116 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-26 17:48:06,116 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:06,117 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-26 17:48:06,117 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:06,117 INFO ]: Found error trace [2018-06-26 17:48:06,117 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:06,117 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:06,117 INFO ]: Analyzing trace with hash 741852820, now seen corresponding path program 1 times [2018-06-26 17:48:06,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:06,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:06,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:06,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,130 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,185 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:06,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:06,195 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:06,206 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,207 INFO ]: Computing forward predicates... [2018-06-26 17:48:06,211 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,232 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:06,232 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 17:48:06,233 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:48:06,233 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:48:06,233 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:06,233 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2018-06-26 17:48:06,245 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:06,245 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-26 17:48:06,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:48:06,245 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:48:06,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:06,246 INFO ]: With dead ends: 14 [2018-06-26 17:48:06,246 INFO ]: Without dead ends: 14 [2018-06-26 17:48:06,247 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:06,247 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:06,249 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 17:48:06,250 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:48:06,250 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-26 17:48:06,250 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2018-06-26 17:48:06,250 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:06,250 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-26 17:48:06,250 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:48:06,250 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-26 17:48:06,250 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:48:06,250 INFO ]: Found error trace [2018-06-26 17:48:06,251 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:06,251 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:06,251 INFO ]: Analyzing trace with hash 594853746, now seen corresponding path program 2 times [2018-06-26 17:48:06,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:06,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:06,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,258 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,293 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,293 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:06,293 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:06,299 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:06,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:06,311 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,312 INFO ]: Computing forward predicates... [2018-06-26 17:48:06,319 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:06,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:48:06,341 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:48:06,341 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:48:06,341 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:06,341 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 6 states. [2018-06-26 17:48:06,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:06,717 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-26 17:48:06,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:48:06,717 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 17:48:06,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:06,718 INFO ]: With dead ends: 17 [2018-06-26 17:48:06,718 INFO ]: Without dead ends: 14 [2018-06-26 17:48:06,718 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:06,718 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:06,719 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:48:06,719 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:48:06,720 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-26 17:48:06,720 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2018-06-26 17:48:06,720 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:06,720 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-26 17:48:06,720 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:48:06,720 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-26 17:48:06,720 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:48:06,720 INFO ]: Found error trace [2018-06-26 17:48:06,720 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:06,720 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:06,721 INFO ]: Analyzing trace with hash 1481821189, now seen corresponding path program 1 times [2018-06-26 17:48:06,721 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:06,721 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:06,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,721 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:06,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:06,732 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,833 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:06,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:06,833 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:06,842 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:06,860 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:06,862 INFO ]: Computing forward predicates... [2018-06-26 17:48:06,931 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 17:48:06,950 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:48:06,950 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-06-26 17:48:06,950 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:06,950 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:06,950 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:06,950 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 7 states. [2018-06-26 17:48:07,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:07,140 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-26 17:48:07,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:48:07,140 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 17:48:07,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:07,140 INFO ]: With dead ends: 27 [2018-06-26 17:48:07,140 INFO ]: Without dead ends: 27 [2018-06-26 17:48:07,141 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:48:07,141 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:48:07,143 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 13. [2018-06-26 17:48:07,143 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:48:07,143 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 17:48:07,143 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2018-06-26 17:48:07,144 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:07,144 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 17:48:07,144 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:07,144 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 17:48:07,144 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:48:07,144 INFO ]: Found error trace [2018-06-26 17:48:07,144 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:07,144 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:07,144 INFO ]: Analyzing trace with hash 1522456113, now seen corresponding path program 2 times [2018-06-26 17:48:07,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:07,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:07,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:07,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,330 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:07,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:07,337 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:07,369 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:07,369 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,371 INFO ]: Computing forward predicates... [2018-06-26 17:48:07,375 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:07,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:48:07,405 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:07,405 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:07,406 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:07,406 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 5 states. [2018-06-26 17:48:07,416 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:07,416 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-26 17:48:07,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:48:07,417 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:48:07,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:07,417 INFO ]: With dead ends: 14 [2018-06-26 17:48:07,417 INFO ]: Without dead ends: 14 [2018-06-26 17:48:07,417 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:07,417 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:07,419 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:48:07,419 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:48:07,419 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-26 17:48:07,419 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-06-26 17:48:07,422 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:07,422 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-26 17:48:07,422 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:07,422 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-26 17:48:07,422 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:48:07,422 INFO ]: Found error trace [2018-06-26 17:48:07,422 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:07,422 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:07,422 INFO ]: Analyzing trace with hash 1260988353, now seen corresponding path program 3 times [2018-06-26 17:48:07,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:07,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:07,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,423 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:07,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,486 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,486 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:07,486 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:07,491 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:07,501 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:48:07,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,503 INFO ]: Computing forward predicates... [2018-06-26 17:48:07,524 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:07,542 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:48:07,543 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-26 17:48:07,543 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:48:07,543 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:48:07,543 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:07,543 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 9 states. [2018-06-26 17:48:07,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:07,774 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-26 17:48:07,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:48:07,774 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-26 17:48:07,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:07,775 INFO ]: With dead ends: 27 [2018-06-26 17:48:07,775 INFO ]: Without dead ends: 22 [2018-06-26 17:48:07,775 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:07,775 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:48:07,777 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-26 17:48:07,777 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:48:07,777 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-26 17:48:07,777 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2018-06-26 17:48:07,778 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:07,778 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-26 17:48:07,778 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:48:07,778 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-26 17:48:07,778 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:48:07,778 INFO ]: Found error trace [2018-06-26 17:48:07,778 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:07,778 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:07,778 INFO ]: Analyzing trace with hash -48645580, now seen corresponding path program 3 times [2018-06-26 17:48:07,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:07,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:07,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,779 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:07,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,786 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,810 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:07,810 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:07,820 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:07,830 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:48:07,830 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,831 INFO ]: Computing forward predicates... [2018-06-26 17:48:07,836 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,855 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:07,855 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:48:07,855 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:48:07,855 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:48:07,855 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:07,855 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 6 states. [2018-06-26 17:48:07,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:07,869 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-26 17:48:07,869 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:48:07,869 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-26 17:48:07,869 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:07,869 INFO ]: With dead ends: 17 [2018-06-26 17:48:07,869 INFO ]: Without dead ends: 17 [2018-06-26 17:48:07,869 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:07,869 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:48:07,871 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-26 17:48:07,871 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:48:07,871 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-26 17:48:07,871 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2018-06-26 17:48:07,871 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:07,871 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-26 17:48:07,871 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:48:07,871 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-26 17:48:07,872 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:48:07,872 INFO ]: Found error trace [2018-06-26 17:48:07,872 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:07,872 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:07,872 INFO ]: Analyzing trace with hash -1508157807, now seen corresponding path program 4 times [2018-06-26 17:48:07,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:07,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:07,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,873 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:07,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:07,880 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,928 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,929 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:07,929 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:07,936 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:07,953 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:07,954 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:07,955 INFO ]: Computing forward predicates... [2018-06-26 17:48:07,961 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:07,982 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:07,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:48:07,982 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:07,982 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:07,982 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:07,982 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2018-06-26 17:48:08,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:08,024 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-26 17:48:08,025 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:48:08,025 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-26 17:48:08,025 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:08,026 INFO ]: With dead ends: 18 [2018-06-26 17:48:08,026 INFO ]: Without dead ends: 18 [2018-06-26 17:48:08,026 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:08,026 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:48:08,027 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-26 17:48:08,027 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:48:08,028 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-26 17:48:08,028 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-06-26 17:48:08,028 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:08,028 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-26 17:48:08,028 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:08,028 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-26 17:48:08,028 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:48:08,028 INFO ]: Found error trace [2018-06-26 17:48:08,028 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:08,028 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:08,029 INFO ]: Analyzing trace with hash 641018675, now seen corresponding path program 1 times [2018-06-26 17:48:08,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:08,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:08,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,029 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:08,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,037 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:08,105 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:08,105 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:08,105 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:08,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:08,135 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:08,136 INFO ]: Computing forward predicates... [2018-06-26 17:48:08,221 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:08,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:08,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-26 17:48:08,241 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:48:08,241 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:48:08,241 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:08,241 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 12 states. [2018-06-26 17:48:08,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:08,599 INFO ]: Finished difference Result 43 states and 53 transitions. [2018-06-26 17:48:08,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:48:08,599 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-26 17:48:08,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:08,600 INFO ]: With dead ends: 43 [2018-06-26 17:48:08,600 INFO ]: Without dead ends: 36 [2018-06-26 17:48:08,600 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:08,600 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:48:08,602 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-06-26 17:48:08,602 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:48:08,602 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-26 17:48:08,603 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2018-06-26 17:48:08,603 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:08,603 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-26 17:48:08,603 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:48:08,603 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-26 17:48:08,603 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:48:08,603 INFO ]: Found error trace [2018-06-26 17:48:08,603 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:08,603 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:08,603 INFO ]: Analyzing trace with hash 491603412, now seen corresponding path program 5 times [2018-06-26 17:48:08,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:08,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:08,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:08,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,610 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:08,653 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:08,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:08,654 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:08,659 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:08,671 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:48:08,671 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:08,672 INFO ]: Computing forward predicates... [2018-06-26 17:48:08,679 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:08,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:08,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:48:08,699 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:48:08,699 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:48:08,699 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:48:08,699 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2018-06-26 17:48:08,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:08,875 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-26 17:48:08,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:48:08,877 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-26 17:48:08,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:08,877 INFO ]: With dead ends: 21 [2018-06-26 17:48:08,877 INFO ]: Without dead ends: 21 [2018-06-26 17:48:08,877 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:48:08,877 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:48:08,879 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-26 17:48:08,879 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:48:08,879 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-26 17:48:08,879 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-06-26 17:48:08,879 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:08,879 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-26 17:48:08,879 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:48:08,879 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-26 17:48:08,879 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:48:08,880 INFO ]: Found error trace [2018-06-26 17:48:08,880 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:08,880 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:08,880 INFO ]: Analyzing trace with hash -1940308239, now seen corresponding path program 6 times [2018-06-26 17:48:08,880 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:08,880 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:08,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:08,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:08,889 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:08,942 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:08,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:08,942 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:08,948 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:09,002 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:48:09,002 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:09,003 INFO ]: Computing forward predicates... [2018-06-26 17:48:09,011 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:09,041 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:09,041 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:48:09,042 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:48:09,042 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:48:09,042 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:09,042 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2018-06-26 17:48:09,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:09,219 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-26 17:48:09,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:48:09,219 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 17:48:09,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:09,220 INFO ]: With dead ends: 22 [2018-06-26 17:48:09,220 INFO ]: Without dead ends: 22 [2018-06-26 17:48:09,220 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:09,220 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:48:09,222 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-26 17:48:09,222 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:48:09,223 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-26 17:48:09,223 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2018-06-26 17:48:09,223 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:09,223 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-26 17:48:09,223 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:48:09,223 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-26 17:48:09,223 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:48:09,223 INFO ]: Found error trace [2018-06-26 17:48:09,223 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:09,223 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:09,224 INFO ]: Analyzing trace with hash -1945653695, now seen corresponding path program 2 times [2018-06-26 17:48:09,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:09,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:09,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:09,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:09,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:09,232 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:09,392 INFO ]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:09,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:09,393 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:09,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:09,411 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:09,411 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:09,413 INFO ]: Computing forward predicates... [2018-06-26 17:48:09,486 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:09,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:09,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-26 17:48:09,507 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:48:09,507 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:48:09,507 INFO ]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:09,507 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 15 states. [2018-06-26 17:48:10,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:10,472 INFO ]: Finished difference Result 64 states and 76 transitions. [2018-06-26 17:48:10,472 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:48:10,472 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-26 17:48:10,472 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:10,473 INFO ]: With dead ends: 64 [2018-06-26 17:48:10,473 INFO ]: Without dead ends: 54 [2018-06-26 17:48:10,474 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:48:10,474 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 17:48:10,476 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 21. [2018-06-26 17:48:10,476 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:48:10,476 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-26 17:48:10,476 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-06-26 17:48:10,476 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:10,476 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-26 17:48:10,476 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:48:10,476 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-26 17:48:10,477 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:48:10,477 INFO ]: Found error trace [2018-06-26 17:48:10,477 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:10,477 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:10,477 INFO ]: Analyzing trace with hash -20158092, now seen corresponding path program 7 times [2018-06-26 17:48:10,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:10,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:10,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:10,478 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:10,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:10,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:10,593 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:10,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:10,593 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:48:10,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:10,621 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:10,622 INFO ]: Computing forward predicates... [2018-06-26 17:48:10,630 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:10,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:10,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:48:10,661 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:48:10,661 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:48:10,661 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:48:10,662 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2018-06-26 17:48:10,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:10,768 INFO ]: Finished difference Result 25 states and 29 transitions. [2018-06-26 17:48:10,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:48:10,768 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-26 17:48:10,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:10,768 INFO ]: With dead ends: 25 [2018-06-26 17:48:10,768 INFO ]: Without dead ends: 25 [2018-06-26 17:48:10,769 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:48:10,769 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:48:10,770 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-26 17:48:10,770 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:48:10,771 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-26 17:48:10,771 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2018-06-26 17:48:10,771 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:10,771 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-26 17:48:10,771 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:48:10,771 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-26 17:48:10,771 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:48:10,771 INFO ]: Found error trace [2018-06-26 17:48:10,771 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:10,771 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:10,771 INFO ]: Analyzing trace with hash -625045679, now seen corresponding path program 8 times [2018-06-26 17:48:10,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:10,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:10,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:10,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:10,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:10,780 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:10,868 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:10,868 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:10,868 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:10,874 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:10,888 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:10,888 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:10,890 INFO ]: Computing forward predicates... [2018-06-26 17:48:10,898 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:10,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:10,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:48:10,930 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:48:10,930 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:48:10,930 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:10,930 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 11 states. [2018-06-26 17:48:10,996 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:10,996 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-26 17:48:10,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:48:10,996 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-26 17:48:10,996 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:10,996 INFO ]: With dead ends: 26 [2018-06-26 17:48:10,996 INFO ]: Without dead ends: 26 [2018-06-26 17:48:10,997 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:10,997 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:48:10,998 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-26 17:48:10,998 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:48:10,999 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-26 17:48:10,999 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-06-26 17:48:10,999 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:10,999 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-26 17:48:10,999 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:48:10,999 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-26 17:48:10,999 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:48:10,999 INFO ]: Found error trace [2018-06-26 17:48:10,999 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:10,999 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:10,999 INFO ]: Analyzing trace with hash 1623102771, now seen corresponding path program 3 times [2018-06-26 17:48:10,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:10,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:11,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:11,000 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:11,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:11,009 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:11,116 INFO ]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:11,116 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:11,116 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:11,130 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:11,157 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:48:11,157 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:11,159 INFO ]: Computing forward predicates... [2018-06-26 17:48:11,270 INFO ]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:48:11,289 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:11,289 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-26 17:48:11,289 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:48:11,290 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:48:11,290 INFO ]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:48:11,290 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 18 states. [2018-06-26 17:48:12,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:12,275 INFO ]: Finished difference Result 89 states and 103 transitions. [2018-06-26 17:48:12,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:48:12,275 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-26 17:48:12,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:12,276 INFO ]: With dead ends: 89 [2018-06-26 17:48:12,276 INFO ]: Without dead ends: 76 [2018-06-26 17:48:12,277 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:48:12,277 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-26 17:48:12,279 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 24. [2018-06-26 17:48:12,279 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:48:12,280 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-26 17:48:12,280 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-06-26 17:48:12,280 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:12,280 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-26 17:48:12,280 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:48:12,280 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-26 17:48:12,280 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:48:12,280 INFO ]: Found error trace [2018-06-26 17:48:12,280 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:12,280 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:12,280 INFO ]: Analyzing trace with hash 2098275604, now seen corresponding path program 9 times [2018-06-26 17:48:12,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:12,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:12,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:12,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:12,475 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:12,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:12,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:12,482 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:12,499 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:48:12,499 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:12,500 INFO ]: Computing forward predicates... [2018-06-26 17:48:12,508 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:12,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:12,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:48:12,527 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:48:12,527 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:48:12,528 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:12,528 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 12 states. [2018-06-26 17:48:12,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:12,599 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-26 17:48:12,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:48:12,600 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-26 17:48:12,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:12,600 INFO ]: With dead ends: 29 [2018-06-26 17:48:12,600 INFO ]: Without dead ends: 29 [2018-06-26 17:48:12,600 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:12,600 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:48:12,602 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-26 17:48:12,602 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:48:12,602 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-06-26 17:48:12,602 INFO ]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2018-06-26 17:48:12,602 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:12,602 INFO ]: Abstraction has 25 states and 29 transitions. [2018-06-26 17:48:12,602 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:48:12,602 INFO ]: Start isEmpty. Operand 25 states and 29 transitions. [2018-06-26 17:48:12,603 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:48:12,603 INFO ]: Found error trace [2018-06-26 17:48:12,603 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:12,603 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:12,603 INFO ]: Analyzing trace with hash 621889457, now seen corresponding path program 10 times [2018-06-26 17:48:12,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:12,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:12,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,604 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:12,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,611 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:12,720 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:12,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:12,720 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:12,727 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:12,743 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:12,743 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:12,745 INFO ]: Computing forward predicates... [2018-06-26 17:48:12,753 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:12,775 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:12,776 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:48:12,776 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:48:12,776 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:48:12,776 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:12,776 INFO ]: Start difference. First operand 25 states and 29 transitions. Second operand 13 states. [2018-06-26 17:48:12,789 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:12,789 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-26 17:48:12,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:48:12,789 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-26 17:48:12,790 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:12,790 INFO ]: With dead ends: 30 [2018-06-26 17:48:12,790 INFO ]: Without dead ends: 30 [2018-06-26 17:48:12,790 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:12,790 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:48:12,792 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-26 17:48:12,792 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:48:12,792 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-26 17:48:12,792 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-06-26 17:48:12,793 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:12,793 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-26 17:48:12,793 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:48:12,793 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-26 17:48:12,793 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:48:12,793 INFO ]: Found error trace [2018-06-26 17:48:12,793 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:12,793 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:12,793 INFO ]: Analyzing trace with hash 2029814977, now seen corresponding path program 4 times [2018-06-26 17:48:12,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:12,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:12,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,794 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:12,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:12,802 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:13,031 INFO ]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:13,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:13,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:13,037 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:13,056 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:13,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:13,057 INFO ]: Computing forward predicates... [2018-06-26 17:48:13,173 INFO ]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:48:13,202 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:13,202 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2018-06-26 17:48:13,202 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:48:13,202 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:48:13,202 INFO ]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:48:13,203 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 23 states. [2018-06-26 17:48:14,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:14,154 INFO ]: Finished difference Result 62 states and 69 transitions. [2018-06-26 17:48:14,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:48:14,154 INFO ]: Start accepts. Automaton has 23 states. Word has length 17 [2018-06-26 17:48:14,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:14,154 INFO ]: With dead ends: 62 [2018-06-26 17:48:14,154 INFO ]: Without dead ends: 45 [2018-06-26 17:48:14,155 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:48:14,155 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 17:48:14,157 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-06-26 17:48:14,157 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:48:14,158 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-26 17:48:14,158 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-06-26 17:48:14,158 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:14,158 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-26 17:48:14,158 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:48:14,158 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-26 17:48:14,158 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:48:14,158 INFO ]: Found error trace [2018-06-26 17:48:14,158 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:14,158 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:14,158 INFO ]: Analyzing trace with hash 2098559156, now seen corresponding path program 11 times [2018-06-26 17:48:14,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:14,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:14,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:14,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:14,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:14,169 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:14,444 INFO ]: Checked inductivity of 66 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:14,445 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:14,445 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:14,452 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:14,470 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:48:14,470 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:14,473 INFO ]: Computing forward predicates... [2018-06-26 17:48:14,508 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:48:14,527 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:14,527 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-06-26 17:48:14,527 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:48:14,527 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:48:14,527 INFO ]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:48:14,527 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 18 states. [2018-06-26 17:48:14,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:14,819 INFO ]: Finished difference Result 52 states and 57 transitions. [2018-06-26 17:48:14,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:48:14,847 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-26 17:48:14,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:14,848 INFO ]: With dead ends: 52 [2018-06-26 17:48:14,848 INFO ]: Without dead ends: 26 [2018-06-26 17:48:14,848 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=412, Invalid=778, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:48:14,848 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:48:14,849 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:48:14,849 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:48:14,850 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-26 17:48:14,850 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-06-26 17:48:14,850 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:14,850 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-26 17:48:14,850 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:48:14,850 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-26 17:48:14,850 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:48:14,850 INFO ]: Found error trace [2018-06-26 17:48:14,850 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:14,850 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:14,851 INFO ]: Analyzing trace with hash -1737003213, now seen corresponding path program 5 times [2018-06-26 17:48:14,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:14,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:14,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:14,851 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:14,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:14,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:15,012 INFO ]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:15,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:15,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:15,018 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:15,036 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:48:15,036 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:15,038 INFO ]: Computing forward predicates... [2018-06-26 17:48:15,160 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:48:15,179 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:15,179 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2018-06-26 17:48:15,179 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:48:15,180 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:48:15,180 INFO ]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:48:15,180 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2018-06-26 17:48:15,883 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:15,884 INFO ]: Finished difference Result 51 states and 55 transitions. [2018-06-26 17:48:15,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:48:15,884 INFO ]: Start accepts. Automaton has 24 states. Word has length 19 [2018-06-26 17:48:15,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:15,884 INFO ]: With dead ends: 51 [2018-06-26 17:48:15,884 INFO ]: Without dead ends: 33 [2018-06-26 17:48:15,885 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=413, Invalid=2137, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:48:15,885 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:48:15,887 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-26 17:48:15,887 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:48:15,887 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-26 17:48:15,887 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-06-26 17:48:15,887 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:15,887 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-26 17:48:15,887 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:48:15,887 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-26 17:48:15,888 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:48:15,888 INFO ]: Found error trace [2018-06-26 17:48:15,888 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:15,888 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:15,888 INFO ]: Analyzing trace with hash -2059687103, now seen corresponding path program 6 times [2018-06-26 17:48:15,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:15,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:15,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:15,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:15,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:15,898 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:16,362 INFO ]: Checked inductivity of 66 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:48:16,363 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:16,363 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:16,378 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:16,403 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:48:16,403 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:16,405 INFO ]: Computing forward predicates... [2018-06-26 17:48:16,580 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:16,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:16,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-06-26 17:48:16,601 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:48:16,601 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:48:16,601 INFO ]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:48:16,601 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2018-06-26 17:48:17,341 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-26 17:48:17,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:17,877 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-26 17:48:17,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:48:17,877 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-26 17:48:17,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:17,877 INFO ]: With dead ends: 54 [2018-06-26 17:48:17,877 INFO ]: Without dead ends: 35 [2018-06-26 17:48:17,878 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=522, Invalid=2784, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:48:17,878 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:48:17,879 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-06-26 17:48:17,880 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:48:17,881 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-26 17:48:17,881 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-06-26 17:48:17,881 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:17,881 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-26 17:48:17,881 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:48:17,881 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-26 17:48:17,882 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:48:17,882 INFO ]: Found error trace [2018-06-26 17:48:17,882 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:17,882 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:17,882 INFO ]: Analyzing trace with hash -1664370381, now seen corresponding path program 7 times [2018-06-26 17:48:17,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:17,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:17,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:17,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:17,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:17,897 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:18,263 INFO ]: Checked inductivity of 83 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:18,263 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:18,263 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:18,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:18,290 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:18,292 INFO ]: Computing forward predicates... [2018-06-26 17:48:18,447 INFO ]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:48:18,466 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:18,466 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-06-26 17:48:18,466 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:18,466 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:18,466 INFO ]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:18,467 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-26 17:48:19,081 WARN ]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-26 17:48:19,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:19,852 INFO ]: Finished difference Result 57 states and 61 transitions. [2018-06-26 17:48:19,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 17:48:19,852 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-26 17:48:19,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:19,853 INFO ]: With dead ends: 57 [2018-06-26 17:48:19,853 INFO ]: Without dead ends: 37 [2018-06-26 17:48:19,854 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=645, Invalid=3515, Unknown=0, NotChecked=0, Total=4160 [2018-06-26 17:48:19,854 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:48:19,856 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-26 17:48:19,856 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:19,856 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:48:19,856 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-06-26 17:48:19,856 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:19,856 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:48:19,856 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:19,856 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:48:19,857 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:48:19,857 INFO ]: Found error trace [2018-06-26 17:48:19,857 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:19,857 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:19,857 INFO ]: Analyzing trace with hash 586752449, now seen corresponding path program 8 times [2018-06-26 17:48:19,857 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:19,857 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:19,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:19,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:19,858 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:19,867 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:20,109 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:20,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:20,109 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) [2018-06-26 17:48:20,124 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:20,185 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:20,185 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:20,188 INFO ]: Computing forward predicates... [2018-06-26 17:48:20,533 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:20,554 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:20,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:48:20,555 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:48:20,555 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:48:20,555 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:20,555 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-26 17:48:20,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:20,997 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-26 17:48:20,997 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:48:20,997 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-26 17:48:20,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:20,997 INFO ]: With dead ends: 38 [2018-06-26 17:48:20,997 INFO ]: Without dead ends: 38 [2018-06-26 17:48:20,997 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:48:20,997 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:48:21,080 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-06-26 17:48:21,080 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:21,081 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:48:21,081 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-06-26 17:48:21,081 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:21,081 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:48:21,081 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:48:21,081 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:48:21,082 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:48:21,082 INFO ]: Found error trace [2018-06-26 17:48:21,082 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:21,082 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:21,082 INFO ]: Analyzing trace with hash 1009311908, now seen corresponding path program 9 times [2018-06-26 17:48:21,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:21,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:21,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:21,083 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:21,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:21,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:21,749 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:21,750 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:21,750 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:21,755 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:21,787 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:48:21,787 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:21,790 INFO ]: Computing forward predicates... [2018-06-26 17:48:21,810 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:21,830 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:21,830 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:48:21,830 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:48:21,830 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:48:21,830 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:21,830 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-26 17:48:22,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:22,579 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-26 17:48:22,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:48:22,579 INFO ]: Start accepts. Automaton has 15 states. Word has length 26 [2018-06-26 17:48:22,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:22,579 INFO ]: With dead ends: 39 [2018-06-26 17:48:22,579 INFO ]: Without dead ends: 39 [2018-06-26 17:48:22,580 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:48:22,580 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:48:22,581 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-26 17:48:22,581 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:22,582 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:48:22,582 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-26 17:48:22,582 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:22,582 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:48:22,582 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:48:22,582 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:48:22,583 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:48:22,583 INFO ]: Found error trace [2018-06-26 17:48:22,583 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:22,585 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:22,585 INFO ]: Analyzing trace with hash 1223753249, now seen corresponding path program 10 times [2018-06-26 17:48:22,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:22,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:22,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:22,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:22,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:22,595 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:23,301 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:48:23,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:23,302 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:23,307 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:23,348 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:23,348 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:23,351 INFO ]: Computing forward predicates... [2018-06-26 17:48:23,407 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:48:23,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:23,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:48:23,426 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:48:23,426 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:48:23,426 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:23,426 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-26 17:48:23,745 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-06-26 17:48:24,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:24,020 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-26 17:48:24,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:24,020 INFO ]: Start accepts. Automaton has 15 states. Word has length 27 [2018-06-26 17:48:24,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:24,020 INFO ]: With dead ends: 40 [2018-06-26 17:48:24,020 INFO ]: Without dead ends: 40 [2018-06-26 17:48:24,020 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:48:24,021 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:48:24,022 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-06-26 17:48:24,022 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:24,022 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:48:24,022 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-26 17:48:24,022 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:24,022 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:48:24,022 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:48:24,022 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:48:24,023 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:48:24,023 INFO ]: Found error trace [2018-06-26 17:48:24,023 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:24,023 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:24,023 INFO ]: Analyzing trace with hash -718499772, now seen corresponding path program 11 times [2018-06-26 17:48:24,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:24,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:24,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:24,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:24,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:24,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:24,213 INFO ]: Checked inductivity of 132 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:48:24,213 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:24,213 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:24,218 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:24,302 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:48:24,302 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:24,304 INFO ]: Computing forward predicates... [2018-06-26 17:48:24,319 INFO ]: Checked inductivity of 132 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:48:24,337 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:48:24,337 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-26 17:48:24,337 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:48:24,337 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:48:24,337 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:24,338 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-26 17:48:24,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:24,357 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-26 17:48:24,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:48:24,357 INFO ]: Start accepts. Automaton has 15 states. Word has length 28 [2018-06-26 17:48:24,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:24,357 INFO ]: With dead ends: 41 [2018-06-26 17:48:24,357 INFO ]: Without dead ends: 29 [2018-06-26 17:48:24,357 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:48:24,357 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:48:24,358 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:48:24,359 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:24,359 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:48:24,359 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2018-06-26 17:48:24,359 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:24,359 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:48:24,359 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:48:24,359 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:48:24,359 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:48:24,359 INFO ]: Found error trace [2018-06-26 17:48:24,359 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:24,359 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:24,359 INFO ]: Analyzing trace with hash -1998363450, now seen corresponding path program 1 times [2018-06-26 17:48:24,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:24,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:24,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:24,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:24,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:24,374 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:24,430 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 17:48:24,431 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:24,431 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:24,436 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:24,460 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:24,463 INFO ]: Computing forward predicates... [2018-06-26 17:48:24,490 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 17:48:24,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:24,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:48:24,509 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:24,510 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:24,510 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:24,510 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2018-06-26 17:48:24,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:24,520 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:48:24,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:48:24,520 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-26 17:48:24,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:24,520 INFO ]: With dead ends: 15 [2018-06-26 17:48:24,520 INFO ]: Without dead ends: 0 [2018-06-26 17:48:24,520 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:48:24,520 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 17:48:24,520 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 17:48:24,520 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 17:48:24,520 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 17:48:24,520 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-06-26 17:48:24,520 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:24,520 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 17:48:24,520 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:24,520 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 17:48:24,520 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 17:48:24,523 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:48:24,525 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:48:24 BasicIcfg [2018-06-26 17:48:24,525 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:48:24,526 INFO ]: Toolchain (without parser) took 20755.80 ms. Allocated memory was 306.7 MB in the beginning and 618.1 MB in the end (delta: 311.4 MB). Free memory was 263.2 MB in the beginning and 448.6 MB in the end (delta: -185.4 MB). Peak memory consumption was 126.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,527 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:48:24,527 INFO ]: ChcToBoogie took 56.89 ms. Allocated memory is still 306.7 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,527 INFO ]: Boogie Preprocessor took 38.88 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,527 INFO ]: RCFGBuilder took 170.46 ms. Allocated memory is still 306.7 MB. Free memory was 260.2 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,530 INFO ]: BlockEncodingV2 took 107.55 ms. Allocated memory is still 306.7 MB. Free memory was 252.2 MB in the beginning and 249.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,530 INFO ]: TraceAbstraction took 20373.46 ms. Allocated memory was 306.7 MB in the beginning and 618.1 MB in the end (delta: 311.4 MB). Free memory was 249.3 MB in the beginning and 448.6 MB in the end (delta: -199.3 MB). Peak memory consumption was 112.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:48:24,534 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 15 edges - StatisticsResult: Encoded RCFG 7 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.89 ms. Allocated memory is still 306.7 MB. Free memory was 263.2 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.88 ms. Allocated memory is still 306.7 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 170.46 ms. Allocated memory is still 306.7 MB. Free memory was 260.2 MB in the beginning and 252.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 107.55 ms. Allocated memory is still 306.7 MB. Free memory was 252.2 MB in the beginning and 249.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20373.46 ms. Allocated memory was 306.7 MB in the beginning and 618.1 MB in the end (delta: 311.4 MB). Free memory was 249.3 MB in the beginning and 448.6 MB in the end (delta: -199.3 MB). Peak memory consumption was 112.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. SAFE Result, 20.2s OverallTime, 31 OverallIterations, 11 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 182 SDslu, 1137 SDs, 0 SdLazy, 2057 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 453 SyntacticMatches, 7 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3210 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 222 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 860 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 57587 SizeOfPredicates, 78 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 674 ConjunctsInUnsatCore, 58 InterpolantComputations, 7 PerfectInterpolantSequences, 1010/2382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-48-24-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-48-24-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-48-24-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-48-24-550.csv Received shutdown request...