java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:58:59,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:58:59,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:58:59,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:58:59,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:58:59,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:58:59,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:58:59,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:58:59,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:58:59,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:58:59,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:58:59,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:58:59,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:58:59,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:58:59,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:58:59,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:58:59,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:58:59,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:58:59,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:58:59,321 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:58:59,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:58:59,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:58:59,328 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:58:59,328 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:58:59,328 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:58:59,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:58:59,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:58:59,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:58:59,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:58:59,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:58:59,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:58:59,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:58:59,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:58:59,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:58:59,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:58:59,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:58:59,340 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:58:59,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:58:59,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:58:59,366 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:58:59,366 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:58:59,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:58:59,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:58:59,367 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:58:59,368 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:58:59,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:58:59,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:58:59,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:58:59,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:58:59,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:58:59,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:58:59,370 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:58:59,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:58:59,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:58:59,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:58:59,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:58:59,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:58:59,371 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:58:59,374 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:58:59,374 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:58:59,428 INFO ]: Repository-Root is: /tmp [2018-06-26 17:58:59,442 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:58:59,446 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:58:59,447 INFO ]: Initializing SmtParser... [2018-06-26 17:58:59,447 INFO ]: SmtParser initialized [2018-06-26 17:58:59,448 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 [2018-06-26 17:58:59,449 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:58:59,529 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 unknown [2018-06-26 17:58:59,682 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/004-horn.smt2 [2018-06-26 17:58:59,687 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:58:59,692 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:58:59,693 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:58:59,693 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:58:59,693 INFO ]: ChcToBoogie initialized [2018-06-26 17:58:59,696 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,744 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59 Unit [2018-06-26 17:58:59,745 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:58:59,745 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:58:59,745 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:58:59,745 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:58:59,765 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,765 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,771 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,771 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,774 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,776 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,777 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (1/1) ... [2018-06-26 17:58:59,778 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:58:59,779 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:58:59,779 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:58:59,780 INFO ]: RCFGBuilder initialized [2018-06-26 17:58:59,780 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (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:58:59,793 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:58:59,793 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:58:59,793 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:58:59,793 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:58:59,793 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:58:59,793 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:59:00,078 INFO ]: Using library mode [2018-06-26 17:59:00,078 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:00 BoogieIcfgContainer [2018-06-26 17:59:00,078 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:59:00,079 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:59:00,079 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:59:00,080 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:59:00,085 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:00" (1/1) ... [2018-06-26 17:59:00,104 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-26 17:59:00,106 INFO ]: Using Remove infeasible edges [2018-06-26 17:59:00,106 INFO ]: Using Maximize final states [2018-06-26 17:59:00,108 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:59:00,108 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:59:00,109 INFO ]: Using Remove sink states [2018-06-26 17:59:00,110 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:59:00,110 INFO ]: Using Use SBE [2018-06-26 17:59:00,115 INFO ]: SBE split 0 edges [2018-06-26 17:59:00,131 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:59:00,132 INFO ]: 0 new accepting states [2018-06-26 17:59:00,173 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 17:59:00,175 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:59:00,178 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:59:00,179 INFO ]: 0 new accepting states [2018-06-26 17:59:00,179 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:59:00,179 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:59:00,179 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-26 17:59:00,180 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:59:00 BasicIcfg [2018-06-26 17:59:00,180 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:59:00,181 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:59:00,181 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:59:00,184 INFO ]: TraceAbstraction initialized [2018-06-26 17:59:00,184 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:58:59" (1/4) ... [2018-06-26 17:59:00,185 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a11d4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:59:00, skipping insertion in model container [2018-06-26 17:59:00,185 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:58:59" (2/4) ... [2018-06-26 17:59:00,185 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a11d4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:59:00, skipping insertion in model container [2018-06-26 17:59:00,185 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:59:00" (3/4) ... [2018-06-26 17:59:00,185 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a11d4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:59:00, skipping insertion in model container [2018-06-26 17:59:00,185 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:59:00" (4/4) ... [2018-06-26 17:59:00,187 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:59:00,198 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:59:00,206 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:59:00,252 INFO ]: Using default assertion order modulation [2018-06-26 17:59:00,252 INFO ]: Interprodecural is true [2018-06-26 17:59:00,252 INFO ]: Hoare is false [2018-06-26 17:59:00,253 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:59:00,253 INFO ]: Backedges is TWOTRACK [2018-06-26 17:59:00,253 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:59:00,253 INFO ]: Difference is false [2018-06-26 17:59:00,253 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:59:00,253 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:59:00,266 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 17:59:00,284 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:59:00,284 INFO ]: Found error trace [2018-06-26 17:59:00,287 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:59:00,287 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:00,292 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-26 17:59:00,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:00,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:00,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:00,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:00,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:00,373 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:00,434 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:59:00,436 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:00,436 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:59:00,437 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:59:00,449 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:59:00,449 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:00,451 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 17:59:00,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:00,515 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-26 17:59:00,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:59:00,517 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:59:00,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:00,524 INFO ]: With dead ends: 7 [2018-06-26 17:59:00,524 INFO ]: Without dead ends: 7 [2018-06-26 17:59:00,526 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:00,539 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:59:00,554 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:59:00,555 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:59:00,555 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 17:59:00,556 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-26 17:59:00,557 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:00,557 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 17:59:00,557 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:59:00,557 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 17:59:00,557 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:59:00,557 INFO ]: Found error trace [2018-06-26 17:59:00,557 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:59:00,557 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:00,557 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-26 17:59:00,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:00,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:00,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:00,558 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:00,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:00,573 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:00,654 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:59:00,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:00,654 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) [2018-06-26 17:59:00,668 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:00,714 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:00,720 INFO ]: Computing forward predicates... [2018-06-26 17:59:00,741 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:59:00,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:00,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 17:59:00,761 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:00,761 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:00,761 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:00,761 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-26 17:59:00,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:00,993 INFO ]: Finished difference Result 8 states and 14 transitions. [2018-06-26 17:59:00,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:59:00,994 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:59:00,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:00,995 INFO ]: With dead ends: 8 [2018-06-26 17:59:00,995 INFO ]: Without dead ends: 8 [2018-06-26 17:59:00,996 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:00,996 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:59:00,997 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:59:00,997 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:59:00,997 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-26 17:59:00,997 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-26 17:59:00,997 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:00,997 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-26 17:59:00,998 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:00,998 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-26 17:59:00,998 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:59:00,998 INFO ]: Found error trace [2018-06-26 17:59:00,998 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:59:00,998 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:00,998 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-26 17:59:00,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:00,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:01,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:01,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,024 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,111 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:59:01,112 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:59:01,112 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:59:01,112 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:59:01,112 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:59:01,112 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:01,112 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 3 states. [2018-06-26 17:59:01,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:01,154 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-26 17:59:01,154 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:59:01,154 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 17:59:01,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:01,155 INFO ]: With dead ends: 9 [2018-06-26 17:59:01,155 INFO ]: Without dead ends: 8 [2018-06-26 17:59:01,155 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:59:01,155 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:59:01,156 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:59:01,156 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:59:01,157 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-26 17:59:01,157 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-26 17:59:01,157 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:01,157 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-26 17:59:01,157 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:59:01,157 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-26 17:59:01,157 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:59:01,157 INFO ]: Found error trace [2018-06-26 17:59:01,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:59:01,157 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:01,158 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-26 17:59:01,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:01,158 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:01,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:01,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,212 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:59:01,212 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:01,212 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:59:01,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:01,241 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,243 INFO ]: Computing forward predicates... [2018-06-26 17:59:01,277 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:59:01,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:01,301 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 17:59:01,301 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:01,302 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:01,302 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:01,302 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 5 states. [2018-06-26 17:59:01,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:01,334 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-26 17:59:01,335 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:59:01,335 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:59:01,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:01,335 INFO ]: With dead ends: 10 [2018-06-26 17:59:01,335 INFO ]: Without dead ends: 10 [2018-06-26 17:59:01,335 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:01,335 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:59:01,337 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:59:01,337 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:59:01,337 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-26 17:59:01,337 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2018-06-26 17:59:01,337 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:01,337 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-26 17:59:01,337 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:01,337 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-26 17:59:01,337 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:59:01,337 INFO ]: Found error trace [2018-06-26 17:59:01,338 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 17:59:01,338 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:01,338 INFO ]: Analyzing trace with hash 1483971524, now seen corresponding path program 2 times [2018-06-26 17:59:01,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:01,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:01,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:01,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,350 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,405 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:01,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:01,405 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:59:01,412 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:01,435 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:01,435 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,437 INFO ]: Computing forward predicates... [2018-06-26 17:59:01,599 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:01,618 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:59:01,618 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-06-26 17:59:01,618 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:59:01,618 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:59:01,618 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:01,618 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-26 17:59:01,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:01,750 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-26 17:59:01,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:59:01,750 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 17:59:01,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:01,750 INFO ]: With dead ends: 12 [2018-06-26 17:59:01,750 INFO ]: Without dead ends: 8 [2018-06-26 17:59:01,751 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:59:01,751 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:59:01,752 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:59:01,752 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:59:01,752 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 17:59:01,752 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2018-06-26 17:59:01,753 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:01,753 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 17:59:01,753 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:59:01,753 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 17:59:01,753 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:59:01,753 INFO ]: Found error trace [2018-06-26 17:59:01,753 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:01,753 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:01,753 INFO ]: Analyzing trace with hash 1484031106, now seen corresponding path program 1 times [2018-06-26 17:59:01,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:01,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:01,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:01,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:01,769 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,841 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:59:01,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:01,842 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:59:01,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:01,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:01,870 INFO ]: Computing forward predicates... [2018-06-26 17:59:01,892 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:59:01,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:01,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:59:01,926 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:59:01,926 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:59:01,926 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:01,926 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-26 17:59:02,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:02,104 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-26 17:59:02,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:59:02,104 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:59:02,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:02,105 INFO ]: With dead ends: 9 [2018-06-26 17:59:02,105 INFO ]: Without dead ends: 9 [2018-06-26 17:59:02,105 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:59:02,105 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:59:02,106 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:59:02,106 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:59:02,106 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-26 17:59:02,106 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-26 17:59:02,106 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:02,107 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-26 17:59:02,107 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:59:02,107 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-26 17:59:02,107 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:59:02,107 INFO ]: Found error trace [2018-06-26 17:59:02,107 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:02,107 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:02,107 INFO ]: Analyzing trace with hash -1240001588, now seen corresponding path program 2 times [2018-06-26 17:59:02,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:02,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:02,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:02,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:02,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:02,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:02,429 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:59:02,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:02,429 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:59:02,438 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:02,476 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:02,476 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:02,478 INFO ]: Computing forward predicates... [2018-06-26 17:59:02,511 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:59:02,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:02,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:59:02,531 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:59:02,531 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:59:02,531 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:59:02,531 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-26 17:59:02,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:02,659 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 17:59:02,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:59:02,659 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 17:59:02,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:02,659 INFO ]: With dead ends: 10 [2018-06-26 17:59:02,659 INFO ]: Without dead ends: 10 [2018-06-26 17:59:02,660 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:59:02,660 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:59:02,661 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:59:02,661 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:59:02,661 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 17:59:02,661 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-26 17:59:02,661 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:02,661 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 17:59:02,661 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:59:02,661 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 17:59:02,661 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:59:02,661 INFO ]: Found error trace [2018-06-26 17:59:02,661 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:02,661 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:02,661 INFO ]: Analyzing trace with hash 214330818, now seen corresponding path program 3 times [2018-06-26 17:59:02,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:02,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:02,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:02,662 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:02,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:02,693 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:03,152 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:59:03,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:03,152 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:59:03,161 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:03,204 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:59:03,204 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:03,207 INFO ]: Computing forward predicates... [2018-06-26 17:59:03,385 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:59:03,419 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:03,419 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:59:03,419 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:59:03,419 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:59:03,419 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:03,419 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-26 17:59:03,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:03,521 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 17:59:03,521 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:59:03,521 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 17:59:03,521 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:03,522 INFO ]: With dead ends: 11 [2018-06-26 17:59:03,522 INFO ]: Without dead ends: 11 [2018-06-26 17:59:03,522 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:59:03,522 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:59:03,523 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:59:03,523 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:59:03,523 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 17:59:03,523 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 17:59:03,523 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:03,523 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 17:59:03,523 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:59:03,523 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 17:59:03,524 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:59:03,524 INFO ]: Found error trace [2018-06-26 17:59:03,524 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:03,524 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:03,524 INFO ]: Analyzing trace with hash -1946004852, now seen corresponding path program 4 times [2018-06-26 17:59:03,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:03,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:03,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:03,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:03,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:03,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:03,673 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:59:03,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:03,673 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:59:03,682 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:03,708 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:03,708 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:03,711 INFO ]: Computing forward predicates... [2018-06-26 17:59:03,738 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:59:03,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:03,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:59:03,764 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:59:03,764 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:59:03,764 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:59:03,764 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-26 17:59:03,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:03,817 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 17:59:03,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:59:03,817 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 17:59:03,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:03,818 INFO ]: With dead ends: 12 [2018-06-26 17:59:03,818 INFO ]: Without dead ends: 12 [2018-06-26 17:59:03,818 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:59:03,818 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:59:03,819 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:59:03,819 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:59:03,819 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 17:59:03,819 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 17:59:03,819 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:03,819 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 17:59:03,819 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:59:03,820 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 17:59:03,820 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:59:03,820 INFO ]: Found error trace [2018-06-26 17:59:03,820 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:03,820 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:03,820 INFO ]: Analyzing trace with hash -196933886, now seen corresponding path program 5 times [2018-06-26 17:59:03,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:03,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:03,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:03,821 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:03,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:03,838 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:04,378 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:59:04,378 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:04,378 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:59:04,387 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:04,434 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:59:04,434 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:04,436 INFO ]: Computing forward predicates... [2018-06-26 17:59:04,468 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:59:04,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:04,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:59:04,502 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:59:04,502 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:59:04,502 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:59:04,502 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-26 17:59:04,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:04,589 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 17:59:04,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:59:04,590 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 17:59:04,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:04,590 INFO ]: With dead ends: 13 [2018-06-26 17:59:04,590 INFO ]: Without dead ends: 13 [2018-06-26 17:59:04,591 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:59:04,591 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:59:04,592 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:59:04,592 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:59:04,592 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 17:59:04,592 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 17:59:04,592 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:04,592 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 17:59:04,592 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:59:04,592 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 17:59:04,593 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:59:04,593 INFO ]: Found error trace [2018-06-26 17:59:04,593 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:04,593 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:04,593 INFO ]: Analyzing trace with hash -1810308788, now seen corresponding path program 6 times [2018-06-26 17:59:04,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:04,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:04,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:04,594 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:04,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:04,616 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:05,201 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:59:05,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:05,201 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:59:05,215 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:05,247 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:59:05,247 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:05,250 INFO ]: Computing forward predicates... [2018-06-26 17:59:05,287 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:59:05,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:05,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:59:05,310 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:59:05,310 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:59:05,310 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:59:05,310 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-26 17:59:05,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:05,365 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 17:59:05,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:59:05,367 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-26 17:59:05,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:05,367 INFO ]: With dead ends: 14 [2018-06-26 17:59:05,367 INFO ]: Without dead ends: 14 [2018-06-26 17:59:05,368 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:59:05,368 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:59:05,369 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:59:05,369 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:59:05,369 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 17:59:05,369 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 17:59:05,369 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:05,369 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 17:59:05,369 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:59:05,369 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 17:59:05,370 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:59:05,370 INFO ]: Found error trace [2018-06-26 17:59:05,370 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:05,370 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:05,370 INFO ]: Analyzing trace with hash -285323198, now seen corresponding path program 7 times [2018-06-26 17:59:05,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:05,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:05,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:05,370 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:05,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:05,386 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:05,647 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:59:05,647 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:05,647 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) [2018-06-26 17:59:05,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:05,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:05,700 INFO ]: Computing forward predicates... [2018-06-26 17:59:05,720 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:59:05,747 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:05,747 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:59:05,747 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:59:05,747 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:59:05,747 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:59:05,747 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-26 17:59:05,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:05,858 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:59:05,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:59:05,858 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 17:59:05,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:05,858 INFO ]: With dead ends: 15 [2018-06-26 17:59:05,858 INFO ]: Without dead ends: 15 [2018-06-26 17:59:05,859 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:59:05,859 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:59:05,860 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:59:05,860 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:59:05,860 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 17:59:05,861 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 17:59:05,861 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:05,861 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 17:59:05,861 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:59:05,861 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 17:59:05,861 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:59:05,861 INFO ]: Found error trace [2018-06-26 17:59:05,861 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:05,861 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:05,861 INFO ]: Analyzing trace with hash -255410164, now seen corresponding path program 8 times [2018-06-26 17:59:05,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:05,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:05,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:05,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:05,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:05,880 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:06,271 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:59:06,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:06,272 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:59:06,277 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:06,320 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:06,320 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:06,325 INFO ]: Computing forward predicates... [2018-06-26 17:59:06,404 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:59:06,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:06,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:59:06,423 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:59:06,424 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:59:06,424 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:59:06,424 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-26 17:59:06,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:06,556 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 17:59:06,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:59:06,557 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 17:59:06,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:06,557 INFO ]: With dead ends: 16 [2018-06-26 17:59:06,557 INFO ]: Without dead ends: 16 [2018-06-26 17:59:06,557 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:59:06,558 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:59:06,559 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:59:06,559 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:59:06,559 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 17:59:06,559 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 17:59:06,559 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:06,559 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 17:59:06,559 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:59:06,559 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 17:59:06,560 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:59:06,560 INFO ]: Found error trace [2018-06-26 17:59:06,560 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:06,560 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:06,560 INFO ]: Analyzing trace with hash 671893890, now seen corresponding path program 9 times [2018-06-26 17:59:06,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:06,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:06,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:06,561 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:06,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:06,577 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:06,946 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:59:06,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:06,946 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:59:06,956 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:06,998 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:59:06,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:07,002 INFO ]: Computing forward predicates... [2018-06-26 17:59:07,024 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:59:07,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:07,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:59:07,052 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:59:07,052 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:59:07,052 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:59:07,052 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-26 17:59:07,200 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:07,200 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 17:59:07,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:59:07,200 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-26 17:59:07,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:07,200 INFO ]: With dead ends: 17 [2018-06-26 17:59:07,200 INFO ]: Without dead ends: 17 [2018-06-26 17:59:07,201 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:59:07,201 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:59:07,202 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:59:07,202 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:59:07,202 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 17:59:07,202 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 17:59:07,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:07,203 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 17:59:07,203 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:59:07,203 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 17:59:07,203 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:59:07,203 INFO ]: Found error trace [2018-06-26 17:59:07,203 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:07,203 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:07,203 INFO ]: Analyzing trace with hash -646451508, now seen corresponding path program 10 times [2018-06-26 17:59:07,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:07,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:07,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:07,204 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:07,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:07,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:07,436 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:07,436 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:07,535 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:07,541 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:07,587 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:07,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:07,592 INFO ]: Computing forward predicates... [2018-06-26 17:59:07,629 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:07,654 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:07,654 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 17:59:07,654 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:59:07,654 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:59:07,654 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:59:07,655 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-26 17:59:07,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:07,781 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 17:59:07,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:59:07,782 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-26 17:59:07,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:07,782 INFO ]: With dead ends: 18 [2018-06-26 17:59:07,782 INFO ]: Without dead ends: 18 [2018-06-26 17:59:07,782 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:59:07,782 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:59:07,784 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:59:07,784 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:59:07,784 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 17:59:07,784 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 17:59:07,784 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:07,784 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 17:59:07,784 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:59:07,784 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 17:59:07,784 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:59:07,785 INFO ]: Found error trace [2018-06-26 17:59:07,785 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:07,785 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:07,785 INFO ]: Analyzing trace with hash 1434514114, now seen corresponding path program 11 times [2018-06-26 17:59:07,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:07,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:07,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:07,785 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:07,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:07,808 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:08,135 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:08,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:08,135 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:59:08,141 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:08,227 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:59:08,227 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:08,233 INFO ]: Computing forward predicates... [2018-06-26 17:59:08,254 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:08,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:08,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:59:08,274 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:59:08,274 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:59:08,274 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:59:08,274 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-26 17:59:08,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:08,393 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 17:59:08,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:59:08,393 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-26 17:59:08,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:08,394 INFO ]: With dead ends: 19 [2018-06-26 17:59:08,394 INFO ]: Without dead ends: 19 [2018-06-26 17:59:08,394 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:59:08,394 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:59:08,395 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:59:08,395 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:59:08,396 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 17:59:08,396 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 17:59:08,396 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:08,396 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 17:59:08,396 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:59:08,396 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 17:59:08,396 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:59:08,396 INFO ]: Found error trace [2018-06-26 17:59:08,396 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:08,396 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:08,396 INFO ]: Analyzing trace with hash 1519938956, now seen corresponding path program 12 times [2018-06-26 17:59:08,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:08,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:08,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:08,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:08,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:08,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:08,832 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:08,832 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:08,832 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:59:08,840 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:08,885 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 17:59:08,885 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:08,890 INFO ]: Computing forward predicates... [2018-06-26 17:59:08,972 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:09,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:09,003 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 17:59:09,004 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:59:09,004 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:59:09,004 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:59:09,004 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-26 17:59:09,254 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:09,254 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 17:59:09,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:59:09,256 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-26 17:59:09,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:09,256 INFO ]: With dead ends: 20 [2018-06-26 17:59:09,256 INFO ]: Without dead ends: 20 [2018-06-26 17:59:09,257 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:59:09,257 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:59:09,258 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:59:09,258 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:59:09,259 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 17:59:09,259 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 17:59:09,259 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:09,259 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 17:59:09,259 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:59:09,259 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 17:59:09,259 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:59:09,259 INFO ]: Found error trace [2018-06-26 17:59:09,259 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:09,259 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:09,259 INFO ]: Analyzing trace with hash -126858238, now seen corresponding path program 13 times [2018-06-26 17:59:09,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:09,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:09,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:09,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:09,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:09,294 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:09,821 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:09,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:09,822 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:59:09,827 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:09,865 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:09,869 INFO ]: Computing forward predicates... [2018-06-26 17:59:09,890 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:09,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:09,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 17:59:09,921 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:59:09,921 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:59:09,921 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:59:09,921 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-26 17:59:10,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:10,380 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 17:59:10,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:59:10,381 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-26 17:59:10,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:10,382 INFO ]: With dead ends: 21 [2018-06-26 17:59:10,382 INFO ]: Without dead ends: 21 [2018-06-26 17:59:10,382 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:59:10,382 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:59:10,384 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:59:10,384 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:59:10,385 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 17:59:10,385 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 17:59:10,385 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:10,385 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 17:59:10,385 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:59:10,385 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 17:59:10,385 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:59:10,385 INFO ]: Found error trace [2018-06-26 17:59:10,385 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:10,385 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:10,385 INFO ]: Analyzing trace with hash 362036300, now seen corresponding path program 14 times [2018-06-26 17:59:10,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:10,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:10,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:10,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:10,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:10,409 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:10,747 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:10,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:10,747 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:59:10,752 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:10,804 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:10,804 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:10,809 INFO ]: Computing forward predicates... [2018-06-26 17:59:10,826 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:10,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:10,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 17:59:10,845 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:59:10,845 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:59:10,845 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:59:10,845 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-26 17:59:11,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:11,041 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 17:59:11,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:59:11,047 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-26 17:59:11,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:11,048 INFO ]: With dead ends: 22 [2018-06-26 17:59:11,048 INFO ]: Without dead ends: 22 [2018-06-26 17:59:11,048 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:59:11,048 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:59:11,050 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:59:11,050 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:59:11,050 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 17:59:11,050 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 17:59:11,051 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:11,051 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 17:59:11,051 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:59:11,051 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 17:59:11,051 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:59:11,051 INFO ]: Found error trace [2018-06-26 17:59:11,051 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:11,051 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:11,051 INFO ]: Analyzing trace with hash -1662102206, now seen corresponding path program 15 times [2018-06-26 17:59:11,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:11,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:11,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:11,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:11,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:11,075 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:12,164 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:12,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:12,165 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:12,172 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:12,222 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:59:12,222 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:12,227 INFO ]: Computing forward predicates... [2018-06-26 17:59:12,252 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:12,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:12,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 17:59:12,283 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:59:12,284 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:59:12,284 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:59:12,284 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-26 17:59:12,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:12,489 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 17:59:12,514 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:59:12,514 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-26 17:59:12,514 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:12,514 INFO ]: With dead ends: 23 [2018-06-26 17:59:12,514 INFO ]: Without dead ends: 23 [2018-06-26 17:59:12,514 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:59:12,515 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:59:12,516 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:59:12,516 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:59:12,517 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 17:59:12,517 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 17:59:12,517 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:12,517 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 17:59:12,517 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:59:12,517 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 17:59:12,517 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:59:12,517 INFO ]: Found error trace [2018-06-26 17:59:12,518 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:12,518 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:12,518 INFO ]: Analyzing trace with hash 14113548, now seen corresponding path program 16 times [2018-06-26 17:59:12,518 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:12,518 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:12,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:12,518 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:12,518 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:12,546 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:13,071 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:13,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:13,071 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:59:13,076 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:13,120 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:13,120 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:13,126 INFO ]: Computing forward predicates... [2018-06-26 17:59:13,160 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:13,191 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:13,191 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 17:59:13,191 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:59:13,191 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:59:13,191 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:59:13,191 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-26 17:59:13,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:13,387 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 17:59:13,387 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:59:13,388 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-26 17:59:13,388 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:13,388 INFO ]: With dead ends: 24 [2018-06-26 17:59:13,388 INFO ]: Without dead ends: 24 [2018-06-26 17:59:13,388 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:59:13,388 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:59:13,390 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:59:13,390 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:59:13,390 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 17:59:13,390 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 17:59:13,390 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:13,390 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 17:59:13,390 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:59:13,390 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 17:59:13,391 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:59:13,391 INFO ]: Found error trace [2018-06-26 17:59:13,391 INFO ]: trace histogram [17, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:13,391 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:13,391 INFO ]: Analyzing trace with hash 437194370, now seen corresponding path program 17 times [2018-06-26 17:59:13,391 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:13,391 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:13,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:13,391 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:13,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:13,416 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:13,761 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:13,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:13,761 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:59:13,766 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:13,927 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:59:13,927 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:13,933 INFO ]: Computing forward predicates... [2018-06-26 17:59:13,966 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:13,990 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:13,990 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 17:59:13,990 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:59:13,990 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:59:13,990 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:59:13,990 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-26 17:59:14,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:14,181 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 17:59:14,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:59:14,182 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-26 17:59:14,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:14,182 INFO ]: With dead ends: 25 [2018-06-26 17:59:14,182 INFO ]: Without dead ends: 25 [2018-06-26 17:59:14,183 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:59:14,183 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:59:14,184 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:59:14,184 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:59:14,185 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 17:59:14,185 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 17:59:14,185 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:14,185 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 17:59:14,185 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:59:14,185 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 17:59:14,186 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:59:14,186 INFO ]: Found error trace [2018-06-26 17:59:14,186 INFO ]: trace histogram [18, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:14,186 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:14,186 INFO ]: Analyzing trace with hash 667797964, now seen corresponding path program 18 times [2018-06-26 17:59:14,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:14,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:14,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:14,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:14,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:14,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:14,613 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:14,613 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:14,613 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:59:14,619 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:14,683 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-26 17:59:14,683 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:14,688 INFO ]: Computing forward predicates... [2018-06-26 17:59:14,720 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:14,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:14,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-26 17:59:14,754 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:59:14,754 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:59:14,754 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:59:14,754 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-26 17:59:15,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:15,011 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 17:59:15,012 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:59:15,012 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-26 17:59:15,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:15,012 INFO ]: With dead ends: 26 [2018-06-26 17:59:15,012 INFO ]: Without dead ends: 26 [2018-06-26 17:59:15,012 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:59:15,013 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:59:15,014 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:59:15,014 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:59:15,014 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 17:59:15,014 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 17:59:15,014 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:15,014 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 17:59:15,014 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:59:15,014 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 17:59:15,014 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:59:15,014 INFO ]: Found error trace [2018-06-26 17:59:15,014 INFO ]: trace histogram [19, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:15,014 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:15,014 INFO ]: Analyzing trace with hash -773425214, now seen corresponding path program 19 times [2018-06-26 17:59:15,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:15,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:15,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:15,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:15,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:15,507 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:15,507 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:15,507 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:59:15,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:15,572 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:15,577 INFO ]: Computing forward predicates... [2018-06-26 17:59:15,604 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:15,637 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:15,637 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-26 17:59:15,637 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:59:15,637 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:59:15,637 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:59:15,637 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-26 17:59:15,923 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:15,923 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 17:59:15,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:59:15,924 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-26 17:59:15,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:15,924 INFO ]: With dead ends: 27 [2018-06-26 17:59:15,924 INFO ]: Without dead ends: 27 [2018-06-26 17:59:15,925 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:59:15,925 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:59:15,926 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:59:15,926 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:59:15,926 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 17:59:15,926 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 17:59:15,926 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:15,926 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 17:59:15,926 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:59:15,926 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 17:59:15,927 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:59:15,927 INFO ]: Found error trace [2018-06-26 17:59:15,927 INFO ]: trace histogram [20, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:15,927 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:15,927 INFO ]: Analyzing trace with hash 1793296524, now seen corresponding path program 20 times [2018-06-26 17:59:15,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:15,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:15,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:15,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:15,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:15,963 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:17,197 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:17,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:17,197 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:17,203 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:17,255 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:17,255 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:17,261 INFO ]: Computing forward predicates... [2018-06-26 17:59:17,285 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:17,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:17,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-26 17:59:17,304 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:59:17,304 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:59:17,304 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:59:17,304 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-26 17:59:17,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:17,662 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 17:59:17,685 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:59:17,685 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-26 17:59:17,686 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:17,686 INFO ]: With dead ends: 28 [2018-06-26 17:59:17,686 INFO ]: Without dead ends: 28 [2018-06-26 17:59:17,686 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:59:17,686 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:59:17,688 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:59:17,688 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:59:17,688 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 17:59:17,688 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 17:59:17,688 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:17,688 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 17:59:17,688 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:59:17,688 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 17:59:17,690 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:59:17,690 INFO ]: Found error trace [2018-06-26 17:59:17,690 INFO ]: trace histogram [21, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:17,690 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:17,690 INFO ]: Analyzing trace with hash -242708222, now seen corresponding path program 21 times [2018-06-26 17:59:17,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:17,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:17,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:17,690 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:17,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:17,756 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:18,211 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:18,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:18,211 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:59:18,218 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:18,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 17:59:18,289 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:18,294 INFO ]: Computing forward predicates... [2018-06-26 17:59:18,323 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:18,354 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:18,354 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-26 17:59:18,354 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:59:18,355 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:59:18,355 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:59:18,355 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-26 17:59:19,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:19,075 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 17:59:19,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:59:19,075 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-26 17:59:19,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:19,076 INFO ]: With dead ends: 29 [2018-06-26 17:59:19,076 INFO ]: Without dead ends: 29 [2018-06-26 17:59:19,076 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:59:19,076 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:59:19,078 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:59:19,078 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:59:19,079 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:59:19,079 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 17:59:19,079 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:19,079 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:59:19,079 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:59:19,079 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:59:19,079 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:59:19,079 INFO ]: Found error trace [2018-06-26 17:59:19,079 INFO ]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:19,079 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:19,080 INFO ]: Analyzing trace with hash 1065654092, now seen corresponding path program 22 times [2018-06-26 17:59:19,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:19,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:19,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:19,080 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:19,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:19,169 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:19,775 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:19,775 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:19,775 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:59:19,781 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:19,862 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:19,862 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:19,871 INFO ]: Computing forward predicates... [2018-06-26 17:59:19,897 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:19,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:19,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-26 17:59:19,915 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:59:19,916 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:59:19,916 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:59:19,916 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-26 17:59:20,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:20,210 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 17:59:20,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:59:20,211 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-26 17:59:20,211 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:20,211 INFO ]: With dead ends: 30 [2018-06-26 17:59:20,211 INFO ]: Without dead ends: 30 [2018-06-26 17:59:20,212 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:59:20,212 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:59:20,213 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:59:20,213 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:59:20,214 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 17:59:20,214 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 17:59:20,214 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:20,214 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 17:59:20,214 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:59:20,214 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 17:59:20,214 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:59:20,214 INFO ]: Found error trace [2018-06-26 17:59:20,214 INFO ]: trace histogram [23, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:20,214 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:20,215 INFO ]: Analyzing trace with hash -1324787134, now seen corresponding path program 23 times [2018-06-26 17:59:20,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:20,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:20,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:20,215 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:20,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:20,293 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:20,928 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:20,928 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:20,928 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:59:20,935 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:21,009 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 17:59:21,010 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:21,017 INFO ]: Computing forward predicates... [2018-06-26 17:59:21,047 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:21,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:21,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-26 17:59:21,069 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:59:21,069 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:59:21,069 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:59:21,070 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-26 17:59:21,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:21,381 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 17:59:21,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:59:21,381 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-26 17:59:21,382 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:21,382 INFO ]: With dead ends: 31 [2018-06-26 17:59:21,382 INFO ]: Without dead ends: 31 [2018-06-26 17:59:21,382 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:59:21,382 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:59:21,384 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:59:21,384 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:59:21,384 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 17:59:21,384 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 17:59:21,384 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:21,384 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 17:59:21,384 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:59:21,384 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 17:59:21,385 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:59:21,385 INFO ]: Found error trace [2018-06-26 17:59:21,385 INFO ]: trace histogram [24, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:21,385 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:21,385 INFO ]: Analyzing trace with hash 1880946188, now seen corresponding path program 24 times [2018-06-26 17:59:21,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:21,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:21,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:21,385 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:21,385 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:21,419 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:22,013 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:22,013 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:22,013 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:22,019 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:22,098 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-26 17:59:22,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:22,105 INFO ]: Computing forward predicates... [2018-06-26 17:59:22,157 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:22,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:22,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-26 17:59:22,188 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:59:22,188 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:59:22,188 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:59:22,188 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-26 17:59:22,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:22,635 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 17:59:22,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:59:22,636 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-26 17:59:22,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:22,636 INFO ]: With dead ends: 32 [2018-06-26 17:59:22,636 INFO ]: Without dead ends: 32 [2018-06-26 17:59:22,637 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:59:22,637 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:59:22,742 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:59:22,742 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:59:22,764 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 17:59:22,764 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 17:59:22,764 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:22,764 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 17:59:22,764 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:59:22,764 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 17:59:22,764 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:59:22,764 INFO ]: Found error trace [2018-06-26 17:59:22,764 INFO ]: trace histogram [25, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:22,764 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:22,765 INFO ]: Analyzing trace with hash -1820535934, now seen corresponding path program 25 times [2018-06-26 17:59:22,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:22,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:22,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:22,765 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:22,765 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:22,799 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:23,443 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:23,443 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:23,443 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:23,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:23,516 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:23,523 INFO ]: Computing forward predicates... [2018-06-26 17:59:23,571 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:23,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:23,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-26 17:59:23,602 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:59:23,602 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:59:23,602 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:59:23,603 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-26 17:59:23,998 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:23,998 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 17:59:24,000 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:59:24,000 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-26 17:59:24,000 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:24,000 INFO ]: With dead ends: 33 [2018-06-26 17:59:24,000 INFO ]: Without dead ends: 33 [2018-06-26 17:59:24,001 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:59:24,001 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:59:24,002 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:59:24,002 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:59:24,003 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 17:59:24,003 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 17:59:24,003 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:24,003 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 17:59:24,003 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:59:24,003 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 17:59:24,003 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:59:24,003 INFO ]: Found error trace [2018-06-26 17:59:24,003 INFO ]: trace histogram [26, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:24,003 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:24,004 INFO ]: Analyzing trace with hash -602364724, now seen corresponding path program 26 times [2018-06-26 17:59:24,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:24,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:24,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:24,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:24,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:24,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:24,697 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:24,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:24,697 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:24,703 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:24,773 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:24,773 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:24,780 INFO ]: Computing forward predicates... [2018-06-26 17:59:24,812 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:24,843 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:24,843 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-26 17:59:24,843 INFO ]: Interpolant automaton has 30 states [2018-06-26 17:59:24,843 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 17:59:24,843 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:59:24,843 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-26 17:59:25,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:25,239 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 17:59:25,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:59:25,240 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-26 17:59:25,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:25,240 INFO ]: With dead ends: 34 [2018-06-26 17:59:25,240 INFO ]: Without dead ends: 34 [2018-06-26 17:59:25,240 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:59:25,240 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:59:25,242 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:59:25,242 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:59:25,243 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 17:59:25,243 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 17:59:25,243 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:25,243 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 17:59:25,243 INFO ]: Interpolant automaton has 30 states. [2018-06-26 17:59:25,243 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 17:59:25,243 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:59:25,243 INFO ]: Found error trace [2018-06-26 17:59:25,243 INFO ]: trace histogram [27, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:25,244 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:25,244 INFO ]: Analyzing trace with hash -1493762878, now seen corresponding path program 27 times [2018-06-26 17:59:25,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:25,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:25,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:25,244 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:25,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:25,318 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:26,322 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:26,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:26,322 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:26,327 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:26,417 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 17:59:26,417 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:26,426 INFO ]: Computing forward predicates... [2018-06-26 17:59:26,456 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:26,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:26,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-26 17:59:26,475 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:59:26,475 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:59:26,476 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:59:26,476 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-26 17:59:26,894 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:26,894 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 17:59:26,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:59:26,895 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-26 17:59:26,895 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:26,895 INFO ]: With dead ends: 35 [2018-06-26 17:59:26,895 INFO ]: Without dead ends: 35 [2018-06-26 17:59:26,896 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:59:26,896 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:59:26,897 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:59:26,897 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:59:26,897 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 17:59:26,898 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 17:59:26,898 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:26,898 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 17:59:26,898 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:59:26,898 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 17:59:26,898 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:59:26,898 INFO ]: Found error trace [2018-06-26 17:59:26,898 INFO ]: trace histogram [28, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:26,898 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:26,898 INFO ]: Analyzing trace with hash 937665420, now seen corresponding path program 28 times [2018-06-26 17:59:26,898 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:26,898 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:26,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:26,900 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:26,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:26,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:27,859 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:27,859 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:27,925 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:27,931 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:28,004 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:28,004 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:28,013 INFO ]: Computing forward predicates... [2018-06-26 17:59:28,041 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:28,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:28,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-26 17:59:28,074 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:59:28,074 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:59:28,075 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:59:28,075 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-26 17:59:28,566 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:28,566 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 17:59:28,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:59:28,566 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-26 17:59:28,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:28,566 INFO ]: With dead ends: 36 [2018-06-26 17:59:28,566 INFO ]: Without dead ends: 36 [2018-06-26 17:59:28,567 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:59:28,567 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:59:28,569 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:59:28,569 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:59:28,569 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 17:59:28,569 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 17:59:28,569 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:28,569 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 17:59:28,569 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:59:28,569 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 17:59:28,570 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:59:28,570 INFO ]: Found error trace [2018-06-26 17:59:28,570 INFO ]: trace histogram [29, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:28,570 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:28,570 INFO ]: Analyzing trace with hash -997468670, now seen corresponding path program 29 times [2018-06-26 17:59:28,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:28,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:28,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:28,570 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:28,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:28,613 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:29,626 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:29,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:29,626 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:29,632 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:29,730 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 17:59:29,730 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:29,740 INFO ]: Computing forward predicates... [2018-06-26 17:59:29,801 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:29,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:29,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-26 17:59:29,831 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:59:29,831 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:59:29,831 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:59:29,831 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-26 17:59:30,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:30,293 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 17:59:30,293 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:59:30,293 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-26 17:59:30,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:30,294 INFO ]: With dead ends: 37 [2018-06-26 17:59:30,294 INFO ]: Without dead ends: 37 [2018-06-26 17:59:30,294 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:59:30,294 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:59:30,301 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:59:30,301 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:59:30,301 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 17:59:30,301 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 17:59:30,301 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:30,301 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 17:59:30,301 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:59:30,301 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 17:59:30,301 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:59:30,301 INFO ]: Found error trace [2018-06-26 17:59:30,301 INFO ]: trace histogram [30, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:30,301 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:30,301 INFO ]: Analyzing trace with hash -857083316, now seen corresponding path program 30 times [2018-06-26 17:59:30,301 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:30,301 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:30,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:30,302 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:30,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:30,333 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:31,078 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:31,078 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:31,078 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:31,083 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:31,185 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-26 17:59:31,185 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:31,194 INFO ]: Computing forward predicates... [2018-06-26 17:59:31,231 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:31,251 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:31,251 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-26 17:59:31,251 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:59:31,252 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:59:31,252 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:59:31,252 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-26 17:59:31,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:31,752 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 17:59:31,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:59:31,752 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-26 17:59:31,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:31,752 INFO ]: With dead ends: 38 [2018-06-26 17:59:31,753 INFO ]: Without dead ends: 38 [2018-06-26 17:59:31,753 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:59:31,753 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:59:31,754 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:59:31,754 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:59:31,754 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 17:59:31,754 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 17:59:31,755 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:31,755 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 17:59:31,755 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:59:31,755 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 17:59:31,755 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:59:31,755 INFO ]: Found error trace [2018-06-26 17:59:31,755 INFO ]: trace histogram [31, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:31,755 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:31,755 INFO ]: Analyzing trace with hash -800104638, now seen corresponding path program 31 times [2018-06-26 17:59:31,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:31,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:31,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:31,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:31,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:31,806 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:33,109 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:33,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:33,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:33,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:33,228 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:33,236 INFO ]: Computing forward predicates... [2018-06-26 17:59:33,261 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:33,281 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:33,281 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-26 17:59:33,281 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:59:33,281 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:59:33,281 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:59:33,281 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-26 17:59:33,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:33,822 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 17:59:33,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:59:33,822 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-26 17:59:33,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:33,823 INFO ]: With dead ends: 39 [2018-06-26 17:59:33,823 INFO ]: Without dead ends: 39 [2018-06-26 17:59:33,823 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:59:33,823 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:59:33,824 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:59:33,824 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:59:33,824 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 17:59:33,824 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 17:59:33,824 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:33,824 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 17:59:33,824 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:59:33,824 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 17:59:33,825 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:59:33,825 INFO ]: Found error trace [2018-06-26 17:59:33,825 INFO ]: trace histogram [32, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:33,825 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:33,825 INFO ]: Analyzing trace with hash 966234380, now seen corresponding path program 32 times [2018-06-26 17:59:33,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:33,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:33,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:33,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:33,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:33,860 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:35,347 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:35,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:35,347 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:35,354 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:35,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:35,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:35,454 INFO ]: Computing forward predicates... [2018-06-26 17:59:35,516 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:35,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:35,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-26 17:59:35,535 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:59:35,536 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:59:35,536 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:59:35,536 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-26 17:59:36,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:36,086 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 17:59:36,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:59:36,086 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-26 17:59:36,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:36,087 INFO ]: With dead ends: 40 [2018-06-26 17:59:36,087 INFO ]: Without dead ends: 40 [2018-06-26 17:59:36,087 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:59:36,087 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:59:36,088 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:59:36,088 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:59:36,088 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 17:59:36,088 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 17:59:36,089 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:36,089 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 17:59:36,089 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:59:36,089 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 17:59:36,089 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:59:36,089 INFO ]: Found error trace [2018-06-26 17:59:36,089 INFO ]: trace histogram [33, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:36,089 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:36,089 INFO ]: Analyzing trace with hash -111830910, now seen corresponding path program 33 times [2018-06-26 17:59:36,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:36,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:36,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:36,090 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:36,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:36,161 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:37,255 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:37,255 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:37,255 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:37,261 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:37,390 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 17:59:37,390 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:37,400 INFO ]: Computing forward predicates... [2018-06-26 17:59:37,431 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:37,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:37,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-26 17:59:37,452 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:59:37,452 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:59:37,452 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:59:37,452 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-06-26 17:59:38,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:38,097 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-26 17:59:38,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:59:38,097 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-26 17:59:38,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:38,098 INFO ]: With dead ends: 41 [2018-06-26 17:59:38,098 INFO ]: Without dead ends: 41 [2018-06-26 17:59:38,098 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:59:38,098 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:59:38,099 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:59:38,099 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:59:38,099 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-26 17:59:38,099 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-26 17:59:38,099 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:38,099 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-26 17:59:38,100 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:59:38,100 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-26 17:59:38,100 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:59:38,100 INFO ]: Found error trace [2018-06-26 17:59:38,100 INFO ]: trace histogram [34, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:38,100 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:38,100 INFO ]: Analyzing trace with hash 827883468, now seen corresponding path program 34 times [2018-06-26 17:59:38,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:38,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:38,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:38,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:38,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:38,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:39,005 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:39,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:39,005 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:39,011 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:39,107 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:39,107 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:39,117 INFO ]: Computing forward predicates... [2018-06-26 17:59:39,312 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:39,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:39,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-06-26 17:59:39,343 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:59:39,343 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:59:39,344 INFO ]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:59:39,344 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-06-26 17:59:40,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:40,724 INFO ]: Finished difference Result 42 states and 42 transitions. [2018-06-26 17:59:40,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-26 17:59:40,724 INFO ]: Start accepts. Automaton has 38 states. Word has length 40 [2018-06-26 17:59:40,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:40,724 INFO ]: With dead ends: 42 [2018-06-26 17:59:40,724 INFO ]: Without dead ends: 42 [2018-06-26 17:59:40,724 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:59:40,725 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 17:59:40,725 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-26 17:59:40,725 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 17:59:40,725 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-06-26 17:59:40,725 INFO ]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-06-26 17:59:40,725 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:40,725 INFO ]: Abstraction has 42 states and 42 transitions. [2018-06-26 17:59:40,725 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:59:40,725 INFO ]: Start isEmpty. Operand 42 states and 42 transitions. [2018-06-26 17:59:40,726 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:59:40,726 INFO ]: Found error trace [2018-06-26 17:59:40,726 INFO ]: trace histogram [35, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:40,726 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:40,726 INFO ]: Analyzing trace with hash -105741886, now seen corresponding path program 35 times [2018-06-26 17:59:40,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:40,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:40,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:40,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:40,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:40,786 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:41,978 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:41,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:41,978 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:41,985 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:42,110 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-06-26 17:59:42,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:42,123 INFO ]: Computing forward predicates... [2018-06-26 17:59:42,211 INFO ]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:42,230 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:42,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-26 17:59:42,231 INFO ]: Interpolant automaton has 39 states [2018-06-26 17:59:42,231 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 17:59:42,231 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:59:42,231 INFO ]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-06-26 17:59:42,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:42,888 INFO ]: Finished difference Result 43 states and 43 transitions. [2018-06-26 17:59:42,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 17:59:42,888 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-26 17:59:42,888 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:42,888 INFO ]: With dead ends: 43 [2018-06-26 17:59:42,888 INFO ]: Without dead ends: 43 [2018-06-26 17:59:42,889 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:59:42,889 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:59:42,890 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-26 17:59:42,890 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:59:42,890 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-06-26 17:59:42,890 INFO ]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-06-26 17:59:42,890 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:42,890 INFO ]: Abstraction has 43 states and 43 transitions. [2018-06-26 17:59:42,890 INFO ]: Interpolant automaton has 39 states. [2018-06-26 17:59:42,890 INFO ]: Start isEmpty. Operand 43 states and 43 transitions. [2018-06-26 17:59:42,890 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 17:59:42,890 INFO ]: Found error trace [2018-06-26 17:59:42,890 INFO ]: trace histogram [36, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:42,890 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:42,890 INFO ]: Analyzing trace with hash 1016643212, now seen corresponding path program 36 times [2018-06-26 17:59:42,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:42,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:42,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:42,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:42,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:42,929 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:43,902 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:43,902 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:43,902 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:43,907 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:44,033 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-26 17:59:44,033 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:44,045 INFO ]: Computing forward predicates... [2018-06-26 17:59:44,087 INFO ]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:44,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:44,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-06-26 17:59:44,120 INFO ]: Interpolant automaton has 40 states [2018-06-26 17:59:44,120 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 17:59:44,120 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:59:44,120 INFO ]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2018-06-26 17:59:45,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:45,079 INFO ]: Finished difference Result 44 states and 44 transitions. [2018-06-26 17:59:45,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 17:59:45,083 INFO ]: Start accepts. Automaton has 40 states. Word has length 42 [2018-06-26 17:59:45,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:45,083 INFO ]: With dead ends: 44 [2018-06-26 17:59:45,083 INFO ]: Without dead ends: 44 [2018-06-26 17:59:45,084 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:59:45,084 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 17:59:45,085 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 17:59:45,085 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:59:45,085 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-06-26 17:59:45,085 INFO ]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-06-26 17:59:45,085 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:45,085 INFO ]: Abstraction has 44 states and 44 transitions. [2018-06-26 17:59:45,085 INFO ]: Interpolant automaton has 40 states. [2018-06-26 17:59:45,085 INFO ]: Start isEmpty. Operand 44 states and 44 transitions. [2018-06-26 17:59:45,086 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 17:59:45,086 INFO ]: Found error trace [2018-06-26 17:59:45,086 INFO ]: trace histogram [37, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:45,086 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:45,086 INFO ]: Analyzing trace with hash 1450842882, now seen corresponding path program 37 times [2018-06-26 17:59:45,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:45,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:45,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:45,086 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:45,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:45,128 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:46,294 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:46,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:46,295 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:46,301 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:46,398 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:46,408 INFO ]: Computing forward predicates... [2018-06-26 17:59:46,448 INFO ]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:46,480 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:46,480 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-06-26 17:59:46,480 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:59:46,480 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:59:46,480 INFO ]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:59:46,480 INFO ]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2018-06-26 17:59:47,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:47,708 INFO ]: Finished difference Result 45 states and 45 transitions. [2018-06-26 17:59:47,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:59:47,708 INFO ]: Start accepts. Automaton has 41 states. Word has length 43 [2018-06-26 17:59:47,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:47,708 INFO ]: With dead ends: 45 [2018-06-26 17:59:47,708 INFO ]: Without dead ends: 45 [2018-06-26 17:59:47,709 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:59:47,709 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 17:59:47,710 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-26 17:59:47,710 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 17:59:47,710 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-06-26 17:59:47,710 INFO ]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-06-26 17:59:47,710 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:47,710 INFO ]: Abstraction has 45 states and 45 transitions. [2018-06-26 17:59:47,710 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:59:47,710 INFO ]: Start isEmpty. Operand 45 states and 45 transitions. [2018-06-26 17:59:47,710 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-26 17:59:47,710 INFO ]: Found error trace [2018-06-26 17:59:47,710 INFO ]: trace histogram [38, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:47,710 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:47,710 INFO ]: Analyzing trace with hash 2026130764, now seen corresponding path program 38 times [2018-06-26 17:59:47,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:47,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:47,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:59:47,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:47,841 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:48,982 INFO ]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:48,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:48,982 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:48,988 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:59:49,088 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:59:49,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:49,109 INFO ]: Computing forward predicates... [2018-06-26 17:59:49,151 INFO ]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:49,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:49,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-06-26 17:59:49,176 INFO ]: Interpolant automaton has 42 states [2018-06-26 17:59:49,176 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-26 17:59:49,177 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:59:49,177 INFO ]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2018-06-26 17:59:49,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:49,967 INFO ]: Finished difference Result 46 states and 46 transitions. [2018-06-26 17:59:49,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-26 17:59:49,967 INFO ]: Start accepts. Automaton has 42 states. Word has length 44 [2018-06-26 17:59:49,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:49,967 INFO ]: With dead ends: 46 [2018-06-26 17:59:49,967 INFO ]: Without dead ends: 46 [2018-06-26 17:59:49,968 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:59:49,968 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 17:59:49,969 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-26 17:59:49,969 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-26 17:59:49,970 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-06-26 17:59:49,970 INFO ]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-06-26 17:59:49,970 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:49,970 INFO ]: Abstraction has 46 states and 46 transitions. [2018-06-26 17:59:49,970 INFO ]: Interpolant automaton has 42 states. [2018-06-26 17:59:49,970 INFO ]: Start isEmpty. Operand 46 states and 46 transitions. [2018-06-26 17:59:49,970 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-26 17:59:49,970 INFO ]: Found error trace [2018-06-26 17:59:49,970 INFO ]: trace histogram [39, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:49,970 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:49,970 INFO ]: Analyzing trace with hash -1614781374, now seen corresponding path program 39 times [2018-06-26 17:59:49,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:49,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:49,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:49,971 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:49,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:50,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,291 INFO ]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:51,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:51,292 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:51,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:59:51,452 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-06-26 17:59:51,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:51,469 INFO ]: Computing forward predicates... [2018-06-26 17:59:51,552 INFO ]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:51,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:51,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-06-26 17:59:51,585 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:59:51,585 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:59:51,585 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:59:51,585 INFO ]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2018-06-26 17:59:52,878 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:52,878 INFO ]: Finished difference Result 47 states and 47 transitions. [2018-06-26 17:59:52,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-26 17:59:52,881 INFO ]: Start accepts. Automaton has 43 states. Word has length 45 [2018-06-26 17:59:52,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:52,881 INFO ]: With dead ends: 47 [2018-06-26 17:59:52,881 INFO ]: Without dead ends: 47 [2018-06-26 17:59:52,882 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:59:52,882 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:59:52,883 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-06-26 17:59:52,883 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 17:59:52,884 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-06-26 17:59:52,884 INFO ]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-06-26 17:59:52,884 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:52,884 INFO ]: Abstraction has 47 states and 47 transitions. [2018-06-26 17:59:52,884 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:59:52,884 INFO ]: Start isEmpty. Operand 47 states and 47 transitions. [2018-06-26 17:59:52,884 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 17:59:52,884 INFO ]: Found error trace [2018-06-26 17:59:52,884 INFO ]: trace histogram [40, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:52,884 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:52,884 INFO ]: Analyzing trace with hash 1481059340, now seen corresponding path program 40 times [2018-06-26 17:59:52,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:52,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:52,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:52,885 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:52,885 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:52,932 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:54,176 INFO ]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:54,176 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:54,176 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:54,181 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:59:54,285 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:59:54,285 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:54,297 INFO ]: Computing forward predicates... [2018-06-26 17:59:54,326 INFO ]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:54,345 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:54,345 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-06-26 17:59:54,346 INFO ]: Interpolant automaton has 44 states [2018-06-26 17:59:54,346 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 17:59:54,346 INFO ]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:59:54,346 INFO ]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2018-06-26 17:59:55,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:55,197 INFO ]: Finished difference Result 48 states and 48 transitions. [2018-06-26 17:59:55,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 17:59:55,197 INFO ]: Start accepts. Automaton has 44 states. Word has length 46 [2018-06-26 17:59:55,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:55,197 INFO ]: With dead ends: 48 [2018-06-26 17:59:55,197 INFO ]: Without dead ends: 48 [2018-06-26 17:59:55,198 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:59:55,198 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 17:59:55,199 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 17:59:55,199 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 17:59:55,199 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-06-26 17:59:55,199 INFO ]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-06-26 17:59:55,199 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:55,199 INFO ]: Abstraction has 48 states and 48 transitions. [2018-06-26 17:59:55,200 INFO ]: Interpolant automaton has 44 states. [2018-06-26 17:59:55,200 INFO ]: Start isEmpty. Operand 48 states and 48 transitions. [2018-06-26 17:59:55,200 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-26 17:59:55,200 INFO ]: Found error trace [2018-06-26 17:59:55,200 INFO ]: trace histogram [41, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:55,200 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:55,200 INFO ]: Analyzing trace with hash -1332126334, now seen corresponding path program 41 times [2018-06-26 17:59:55,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:55,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:55,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:55,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:55,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:55,250 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:56,690 INFO ]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:56,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:56,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:56,696 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:59:56,854 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-06-26 17:59:56,854 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:56,872 INFO ]: Computing forward predicates... [2018-06-26 17:59:56,991 INFO ]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:57,011 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:57,011 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-06-26 17:59:57,011 INFO ]: Interpolant automaton has 45 states [2018-06-26 17:59:57,011 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-26 17:59:57,012 INFO ]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:59:57,012 INFO ]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2018-06-26 17:59:57,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:59:57,924 INFO ]: Finished difference Result 49 states and 49 transitions. [2018-06-26 17:59:57,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-26 17:59:57,924 INFO ]: Start accepts. Automaton has 45 states. Word has length 47 [2018-06-26 17:59:57,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:59:57,925 INFO ]: With dead ends: 49 [2018-06-26 17:59:57,925 INFO ]: Without dead ends: 49 [2018-06-26 17:59:57,925 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:59:57,925 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:59:57,926 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-26 17:59:57,926 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-26 17:59:57,927 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-06-26 17:59:57,927 INFO ]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-06-26 17:59:57,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:59:57,927 INFO ]: Abstraction has 49 states and 49 transitions. [2018-06-26 17:59:57,927 INFO ]: Interpolant automaton has 45 states. [2018-06-26 17:59:57,927 INFO ]: Start isEmpty. Operand 49 states and 49 transitions. [2018-06-26 17:59:57,927 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-26 17:59:57,927 INFO ]: Found error trace [2018-06-26 17:59:57,927 INFO ]: trace histogram [42, 1, 1, 1, 1, 1, 1] [2018-06-26 17:59:57,927 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:59:57,927 INFO ]: Analyzing trace with hash 1653430988, now seen corresponding path program 42 times [2018-06-26 17:59:57,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:59:57,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:59:57,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:57,928 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:59:57,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:59:57,988 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:59,339 INFO ]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:59,339 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:59:59,339 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:59:59,344 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:59:59,500 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-06-26 17:59:59,500 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:59:59,516 INFO ]: Computing forward predicates... [2018-06-26 17:59:59,565 INFO ]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:59:59,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:59:59,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-06-26 17:59:59,586 INFO ]: Interpolant automaton has 46 states [2018-06-26 17:59:59,586 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 17:59:59,586 INFO ]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:59:59,586 INFO ]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. Received shutdown request... [2018-06-26 18:00:00,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 18:00:00,102 WARN ]: Verification canceled [2018-06-26 18:00:00,105 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:00:00,106 WARN ]: Timeout [2018-06-26 18:00:00,106 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:00:00 BasicIcfg [2018-06-26 18:00:00,106 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:00:00,107 INFO ]: Toolchain (without parser) took 60419.70 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 707.8 MB). Free memory was 263.1 MB in the beginning and 837.0 MB in the end (delta: -573.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,109 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:00:00,109 INFO ]: ChcToBoogie took 51.89 ms. Allocated memory is still 306.7 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,109 INFO ]: Boogie Preprocessor took 33.25 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,110 INFO ]: RCFGBuilder took 298.84 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,110 INFO ]: BlockEncodingV2 took 101.04 ms. Allocated memory is still 306.7 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,110 INFO ]: TraceAbstraction took 59925.71 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 707.8 MB). Free memory was 247.1 MB in the beginning and 837.0 MB in the end (delta: -589.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 3.6 GB. [2018-06-26 18:00:00,113 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.89 ms. Allocated memory is still 306.7 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.25 ms. Allocated memory is still 306.7 MB. Free memory was 261.1 MB in the beginning and 259.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 298.84 ms. Allocated memory is still 306.7 MB. Free memory was 259.1 MB in the beginning and 251.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 101.04 ms. Allocated memory is still 306.7 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59925.71 ms. Allocated memory was 306.7 MB in the beginning and 1.0 GB in the end (delta: 707.8 MB). Free memory was 247.1 MB in the beginning and 837.0 MB in the end (delta: -589.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (49states) and interpolant automaton (currently 27 states, 46 states before enhancement), while ReachableStatesComputation was computing reachable states (26 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.8s OverallTime, 47 OverallIterations, 42 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 1 SDslu, 2903 SDs, 0 SdLazy, 30487 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2219 GetRequests, 1134 SyntacticMatches, 84 SemanticMatches, 1001 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 2359 NumberOfCodeBlocks, 2359 NumberOfCodeBlocksAsserted, 352 NumberOfCheckSat, 2267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1523499 SizeOfPredicates, 179 NumberOfNonLiveVariables, 24801 ConjunctsInSsa, 15293 ConjunctsInUnsatCore, 92 InterpolantComputations, 3 PerfectInterpolantSequences, 6/28389 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-00-00-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-00-00-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-00-00-123.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/004-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-00-00-123.csv Completed graceful shutdown