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/008b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:00:24,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:00:24,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:00:24,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:00:24,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:00:24,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:00:24,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:00:24,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:00:24,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:00:24,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:00:24,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:00:24,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:00:24,228 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:00:24,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:00:24,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:00:24,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:00:24,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:00:24,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:00:24,250 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:00:24,251 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:00:24,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:00:24,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:00:24,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:00:24,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:00:24,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:00:24,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:00:24,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:00:24,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:00:24,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:00:24,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:00:24,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:00:24,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:00:24,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:00:24,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:00:24,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:00:24,270 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:00:24,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:00:24,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:00:24,298 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:00:24,298 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:00:24,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:00:24,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:00:24,300 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:00:24,300 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:00:24,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:00:24,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:00:24,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:00:24,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:00:24,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:00:24,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:00:24,302 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:00:24,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:00:24,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:00:24,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:00:24,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:00:24,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:00:24,303 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:00:24,306 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:00:24,306 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:00:24,350 INFO ]: Repository-Root is: /tmp [2018-06-24 21:00:24,366 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:00:24,372 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:00:24,374 INFO ]: Initializing SmtParser... [2018-06-24 21:00:24,374 INFO ]: SmtParser initialized [2018-06-24 21:00:24,375 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-24 21:00:24,376 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:00:24,463 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 unknown [2018-06-24 21:00:24,659 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/008b-horn.smt2 [2018-06-24 21:00:24,664 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:00:24,670 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:00:24,670 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:00:24,670 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:00:24,670 INFO ]: ChcToBoogie initialized [2018-06-24 21:00:24,673 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,737 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24 Unit [2018-06-24 21:00:24,737 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:00:24,737 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:00:24,737 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:00:24,738 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:00:24,759 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,760 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,768 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,768 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,784 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,786 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,788 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... [2018-06-24 21:00:24,789 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:00:24,790 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:00:24,790 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:00:24,790 INFO ]: RCFGBuilder initialized [2018-06-24 21:00:24,791 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:00:24,815 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:00:24,815 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:00:24,815 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:00:24,815 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:00:24,815 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:00:24,815 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:00:25,243 INFO ]: Using library mode [2018-06-24 21:00:25,244 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:25 BoogieIcfgContainer [2018-06-24 21:00:25,244 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:00:25,244 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:00:25,244 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:00:25,245 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:00:25,253 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:25" (1/1) ... [2018-06-24 21:00:25,266 INFO ]: Initial Icfg 10 locations, 20 edges [2018-06-24 21:00:25,268 INFO ]: Using Remove infeasible edges [2018-06-24 21:00:25,268 INFO ]: Using Maximize final states [2018-06-24 21:00:25,269 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:00:25,269 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:00:25,270 INFO ]: Using Remove sink states [2018-06-24 21:00:25,271 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:00:25,271 INFO ]: Using Use SBE [2018-06-24 21:00:25,282 INFO ]: SBE split 0 edges [2018-06-24 21:00:25,287 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:00:25,289 INFO ]: 0 new accepting states [2018-06-24 21:00:25,320 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:00:25,322 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:00:25,325 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:00:25,326 INFO ]: 0 new accepting states [2018-06-24 21:00:25,326 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:00:25,326 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:00:25,326 INFO ]: Encoded RCFG 6 locations, 16 edges [2018-06-24 21:00:25,328 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:00:25 BasicIcfg [2018-06-24 21:00:25,328 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:00:25,329 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:00:25,329 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:00:25,332 INFO ]: TraceAbstraction initialized [2018-06-24 21:00:25,332 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:00:24" (1/4) ... [2018-06-24 21:00:25,333 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e0455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:00:25, skipping insertion in model container [2018-06-24 21:00:25,333 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:00:24" (2/4) ... [2018-06-24 21:00:25,333 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e0455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:00:25, skipping insertion in model container [2018-06-24 21:00:25,333 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:00:25" (3/4) ... [2018-06-24 21:00:25,334 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116e0455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:00:25, skipping insertion in model container [2018-06-24 21:00:25,334 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:00:25" (4/4) ... [2018-06-24 21:00:25,335 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:00:25,344 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:00:25,352 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:00:25,403 INFO ]: Using default assertion order modulation [2018-06-24 21:00:25,404 INFO ]: Interprodecural is true [2018-06-24 21:00:25,404 INFO ]: Hoare is false [2018-06-24 21:00:25,404 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:00:25,404 INFO ]: Backedges is TWOTRACK [2018-06-24 21:00:25,404 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:00:25,404 INFO ]: Difference is false [2018-06-24 21:00:25,404 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:00:25,404 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:00:25,419 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:00:25,436 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:00:25,436 INFO ]: Found error trace [2018-06-24 21:00:25,439 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:00:25,440 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:25,445 INFO ]: Analyzing trace with hash 44945612, now seen corresponding path program 1 times [2018-06-24 21:00:25,447 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:25,447 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:25,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:25,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:25,485 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:25,524 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:25,583 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:25,585 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:25,585 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:25,587 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:25,602 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:25,602 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:25,605 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:00:25,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:25,769 INFO ]: Finished difference Result 7 states and 27 transitions. [2018-06-24 21:00:25,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:25,771 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:00:25,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:25,779 INFO ]: With dead ends: 7 [2018-06-24 21:00:25,779 INFO ]: Without dead ends: 7 [2018-06-24 21:00:25,781 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:25,793 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:00:25,816 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:00:25,817 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:00:25,818 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-06-24 21:00:25,819 INFO ]: Start accepts. Automaton has 7 states and 27 transitions. Word has length 5 [2018-06-24 21:00:25,820 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:25,820 INFO ]: Abstraction has 7 states and 27 transitions. [2018-06-24 21:00:25,820 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:25,820 INFO ]: Start isEmpty. Operand 7 states and 27 transitions. [2018-06-24 21:00:25,820 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:25,820 INFO ]: Found error trace [2018-06-24 21:00:25,820 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:25,821 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:25,821 INFO ]: Analyzing trace with hash 1392720243, now seen corresponding path program 1 times [2018-06-24 21:00:25,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:25,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:25,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:25,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:25,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:25,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:26,053 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:26,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:26,053 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-24 21:00:26,068 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-24 21:00:26,118 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:26,126 INFO ]: Computing forward predicates... [2018-06-24 21:00:26,173 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:26,192 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:26,192 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 21:00:26,193 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:00:26,193 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:00:26,193 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:00:26,193 INFO ]: Start difference. First operand 7 states and 27 transitions. Second operand 5 states. [2018-06-24 21:00:26,432 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-06-24 21:00:26,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:26,944 INFO ]: Finished difference Result 11 states and 63 transitions. [2018-06-24 21:00:26,945 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:00:26,945 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:00:26,945 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:26,946 INFO ]: With dead ends: 11 [2018-06-24 21:00:26,946 INFO ]: Without dead ends: 11 [2018-06-24 21:00:26,946 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:26,946 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:26,949 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:00:26,949 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:26,950 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-06-24 21:00:26,950 INFO ]: Start accepts. Automaton has 11 states and 63 transitions. Word has length 6 [2018-06-24 21:00:26,950 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:26,950 INFO ]: Abstraction has 11 states and 63 transitions. [2018-06-24 21:00:26,950 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:00:26,950 INFO ]: Start isEmpty. Operand 11 states and 63 transitions. [2018-06-24 21:00:26,950 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:26,950 INFO ]: Found error trace [2018-06-24 21:00:26,950 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:26,950 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:26,950 INFO ]: Analyzing trace with hash 1392750034, now seen corresponding path program 1 times [2018-06-24 21:00:26,951 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:26,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:26,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:26,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:26,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:26,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,056 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:27,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:27,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:27,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:27,113 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,115 INFO ]: Computing forward predicates... [2018-06-24 21:00:27,246 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:27,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:27,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:00:27,277 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:27,277 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:27,277 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:27,278 INFO ]: Start difference. First operand 11 states and 63 transitions. Second operand 6 states. [2018-06-24 21:00:27,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:27,621 INFO ]: Finished difference Result 21 states and 128 transitions. [2018-06-24 21:00:27,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:27,621 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:00:27,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:27,623 INFO ]: With dead ends: 21 [2018-06-24 21:00:27,623 INFO ]: Without dead ends: 21 [2018-06-24 21:00:27,624 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:27,624 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 21:00:27,627 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-24 21:00:27,628 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:00:27,629 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-06-24 21:00:27,629 INFO ]: Start accepts. Automaton has 17 states and 110 transitions. Word has length 6 [2018-06-24 21:00:27,629 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:27,629 INFO ]: Abstraction has 17 states and 110 transitions. [2018-06-24 21:00:27,629 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:27,629 INFO ]: Start isEmpty. Operand 17 states and 110 transitions. [2018-06-24 21:00:27,629 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:27,629 INFO ]: Found error trace [2018-06-24 21:00:27,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:27,630 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:27,630 INFO ]: Analyzing trace with hash 1392779825, now seen corresponding path program 1 times [2018-06-24 21:00:27,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:27,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:27,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:27,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:27,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:27,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,682 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:27,682 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:27,682 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:27,689 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:27,712 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,714 INFO ]: Computing forward predicates... [2018-06-24 21:00:27,789 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:27,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:27,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 21:00:27,822 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:00:27,823 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:00:27,823 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:00:27,823 INFO ]: Start difference. First operand 17 states and 110 transitions. Second operand 4 states. [2018-06-24 21:00:28,088 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:28,088 INFO ]: Finished difference Result 22 states and 149 transitions. [2018-06-24 21:00:28,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:00:28,089 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:00:28,089 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:28,090 INFO ]: With dead ends: 22 [2018-06-24 21:00:28,090 INFO ]: Without dead ends: 22 [2018-06-24 21:00:28,090 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:00:28,090 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 21:00:28,094 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-06-24 21:00:28,094 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 21:00:28,095 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 132 transitions. [2018-06-24 21:00:28,095 INFO ]: Start accepts. Automaton has 19 states and 132 transitions. Word has length 6 [2018-06-24 21:00:28,095 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:28,095 INFO ]: Abstraction has 19 states and 132 transitions. [2018-06-24 21:00:28,095 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:00:28,095 INFO ]: Start isEmpty. Operand 19 states and 132 transitions. [2018-06-24 21:00:28,095 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:28,095 INFO ]: Found error trace [2018-06-24 21:00:28,095 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:28,096 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:28,096 INFO ]: Analyzing trace with hash 1392869198, now seen corresponding path program 1 times [2018-06-24 21:00:28,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:28,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:28,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,106 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,149 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:28,149 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:28,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,173 INFO ]: Computing forward predicates... [2018-06-24 21:00:28,192 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:28,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:00:28,211 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:28,211 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:28,211 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:28,211 INFO ]: Start difference. First operand 19 states and 132 transitions. Second operand 6 states. [2018-06-24 21:00:28,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:28,452 INFO ]: Finished difference Result 28 states and 213 transitions. [2018-06-24 21:00:28,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:28,453 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:00:28,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:28,454 INFO ]: With dead ends: 28 [2018-06-24 21:00:28,454 INFO ]: Without dead ends: 28 [2018-06-24 21:00:28,455 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:28,455 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:00:28,462 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-24 21:00:28,462 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:00:28,463 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 179 transitions. [2018-06-24 21:00:28,463 INFO ]: Start accepts. Automaton has 24 states and 179 transitions. Word has length 6 [2018-06-24 21:00:28,463 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:28,463 INFO ]: Abstraction has 24 states and 179 transitions. [2018-06-24 21:00:28,463 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:28,463 INFO ]: Start isEmpty. Operand 24 states and 179 transitions. [2018-06-24 21:00:28,467 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:00:28,467 INFO ]: Found error trace [2018-06-24 21:00:28,467 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:00:28,467 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:28,467 INFO ]: Analyzing trace with hash 1392928780, now seen corresponding path program 1 times [2018-06-24 21:00:28,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:28,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:28,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,478 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,540 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,540 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:28,541 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:28,548 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,567 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,568 INFO ]: Computing forward predicates... [2018-06-24 21:00:28,620 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,639 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:28,639 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 21:00:28,639 INFO ]: Interpolant automaton has 5 states [2018-06-24 21:00:28,639 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 21:00:28,639 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:00:28,639 INFO ]: Start difference. First operand 24 states and 179 transitions. Second operand 5 states. [2018-06-24 21:00:28,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:28,703 INFO ]: Finished difference Result 28 states and 191 transitions. [2018-06-24 21:00:28,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:00:28,703 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 21:00:28,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:28,704 INFO ]: With dead ends: 28 [2018-06-24 21:00:28,704 INFO ]: Without dead ends: 28 [2018-06-24 21:00:28,704 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:28,705 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 21:00:28,708 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-24 21:00:28,708 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 21:00:28,709 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-06-24 21:00:28,709 INFO ]: Start accepts. Automaton has 24 states and 163 transitions. Word has length 6 [2018-06-24 21:00:28,709 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:28,709 INFO ]: Abstraction has 24 states and 163 transitions. [2018-06-24 21:00:28,709 INFO ]: Interpolant automaton has 5 states. [2018-06-24 21:00:28,709 INFO ]: Start isEmpty. Operand 24 states and 163 transitions. [2018-06-24 21:00:28,710 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:28,710 INFO ]: Found error trace [2018-06-24 21:00:28,710 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:28,710 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:28,710 INFO ]: Analyzing trace with hash 225937677, now seen corresponding path program 1 times [2018-06-24 21:00:28,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:28,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:28,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,742 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:28,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:28,742 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:28,742 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:28,742 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:28,743 INFO ]: Start difference. First operand 24 states and 163 transitions. Second operand 3 states. [2018-06-24 21:00:28,788 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:28,788 INFO ]: Finished difference Result 29 states and 181 transitions. [2018-06-24 21:00:28,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:28,789 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:00:28,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:28,790 INFO ]: With dead ends: 29 [2018-06-24 21:00:28,790 INFO ]: Without dead ends: 29 [2018-06-24 21:00:28,790 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:28,790 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 21:00:28,793 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-06-24 21:00:28,794 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:00:28,795 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 180 transitions. [2018-06-24 21:00:28,795 INFO ]: Start accepts. Automaton has 28 states and 180 transitions. Word has length 7 [2018-06-24 21:00:28,795 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:28,795 INFO ]: Abstraction has 28 states and 180 transitions. [2018-06-24 21:00:28,795 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:28,795 INFO ]: Start isEmpty. Operand 28 states and 180 transitions. [2018-06-24 21:00:28,795 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:28,795 INFO ]: Found error trace [2018-06-24 21:00:28,796 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 21:00:28,796 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:28,796 INFO ]: Analyzing trace with hash 225967468, now seen corresponding path program 2 times [2018-06-24 21:00:28,796 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:28,796 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:28,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:28,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:28,807 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,882 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:28,882 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:28,895 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:28,910 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:28,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:28,911 INFO ]: Computing forward predicates... [2018-06-24 21:00:28,936 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:28,956 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:28,956 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-24 21:00:28,956 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:28,956 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:28,956 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:28,956 INFO ]: Start difference. First operand 28 states and 180 transitions. Second operand 7 states. [2018-06-24 21:00:29,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:29,267 INFO ]: Finished difference Result 34 states and 150 transitions. [2018-06-24 21:00:29,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:29,268 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 21:00:29,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:29,268 INFO ]: With dead ends: 34 [2018-06-24 21:00:29,268 INFO ]: Without dead ends: 34 [2018-06-24 21:00:29,269 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:29,269 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 21:00:29,272 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 25. [2018-06-24 21:00:29,272 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:00:29,273 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 110 transitions. [2018-06-24 21:00:29,273 INFO ]: Start accepts. Automaton has 25 states and 110 transitions. Word has length 7 [2018-06-24 21:00:29,273 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:29,273 INFO ]: Abstraction has 25 states and 110 transitions. [2018-06-24 21:00:29,273 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:29,273 INFO ]: Start isEmpty. Operand 25 states and 110 transitions. [2018-06-24 21:00:29,273 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:29,273 INFO ]: Found error trace [2018-06-24 21:00:29,273 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:29,273 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:29,274 INFO ]: Analyzing trace with hash 226205796, now seen corresponding path program 1 times [2018-06-24 21:00:29,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:29,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:29,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:29,274 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:29,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:29,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:29,332 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:29,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:29,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:29,343 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:29,367 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:29,369 INFO ]: Computing forward predicates... [2018-06-24 21:00:29,764 WARN ]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:00:29,768 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:29,786 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:29,786 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:00:29,787 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:00:29,787 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:00:29,787 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:29,787 INFO ]: Start difference. First operand 25 states and 110 transitions. Second operand 8 states. [2018-06-24 21:00:30,518 WARN ]: Spent 557.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-06-24 21:00:31,074 WARN ]: Spent 542.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-06-24 21:00:31,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:31,209 INFO ]: Finished difference Result 44 states and 167 transitions. [2018-06-24 21:00:31,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:00:31,209 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:00:31,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:31,210 INFO ]: With dead ends: 44 [2018-06-24 21:00:31,210 INFO ]: Without dead ends: 44 [2018-06-24 21:00:31,211 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:00:31,211 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 21:00:31,215 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-24 21:00:31,215 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 21:00:31,216 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 128 transitions. [2018-06-24 21:00:31,216 INFO ]: Start accepts. Automaton has 31 states and 128 transitions. Word has length 7 [2018-06-24 21:00:31,216 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:31,216 INFO ]: Abstraction has 31 states and 128 transitions. [2018-06-24 21:00:31,216 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:00:31,216 INFO ]: Start isEmpty. Operand 31 states and 128 transitions. [2018-06-24 21:00:31,216 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:31,216 INFO ]: Found error trace [2018-06-24 21:00:31,216 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:31,217 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:31,217 INFO ]: Analyzing trace with hash 226861198, now seen corresponding path program 1 times [2018-06-24 21:00:31,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:31,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:31,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:31,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:31,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:31,227 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:31,425 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:31,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:31,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:31,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:31,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:31,450 INFO ]: Computing forward predicates... [2018-06-24 21:00:31,540 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:31,561 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:31,561 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-24 21:00:31,561 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:00:31,562 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:00:31,562 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:31,562 INFO ]: Start difference. First operand 31 states and 128 transitions. Second operand 8 states. [2018-06-24 21:00:31,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:31,764 INFO ]: Finished difference Result 40 states and 157 transitions. [2018-06-24 21:00:31,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:31,764 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 21:00:31,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:31,765 INFO ]: With dead ends: 40 [2018-06-24 21:00:31,765 INFO ]: Without dead ends: 40 [2018-06-24 21:00:31,765 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:00:31,765 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 21:00:31,769 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-06-24 21:00:31,769 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 21:00:31,770 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 134 transitions. [2018-06-24 21:00:31,770 INFO ]: Start accepts. Automaton has 33 states and 134 transitions. Word has length 7 [2018-06-24 21:00:31,770 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:31,770 INFO ]: Abstraction has 33 states and 134 transitions. [2018-06-24 21:00:31,770 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:00:31,770 INFO ]: Start isEmpty. Operand 33 states and 134 transitions. [2018-06-24 21:00:31,770 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:31,770 INFO ]: Found error trace [2018-06-24 21:00:31,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:31,770 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:31,771 INFO ]: Analyzing trace with hash 226980362, now seen corresponding path program 1 times [2018-06-24 21:00:31,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:31,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:31,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:31,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:31,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:31,781 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:31,824 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:31,824 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:31,824 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:31,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:31,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:31,857 INFO ]: Computing forward predicates... [2018-06-24 21:00:31,882 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:31,901 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:31,901 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 21:00:31,901 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:00:31,901 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:00:31,901 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:00:31,902 INFO ]: Start difference. First operand 33 states and 134 transitions. Second operand 6 states. [2018-06-24 21:00:32,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:32,011 INFO ]: Finished difference Result 43 states and 173 transitions. [2018-06-24 21:00:32,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:32,011 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:00:32,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:32,012 INFO ]: With dead ends: 43 [2018-06-24 21:00:32,012 INFO ]: Without dead ends: 43 [2018-06-24 21:00:32,012 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:32,012 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 21:00:32,015 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-06-24 21:00:32,016 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:00:32,016 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 138 transitions. [2018-06-24 21:00:32,016 INFO ]: Start accepts. Automaton has 34 states and 138 transitions. Word has length 7 [2018-06-24 21:00:32,016 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:32,016 INFO ]: Abstraction has 34 states and 138 transitions. [2018-06-24 21:00:32,016 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:00:32,016 INFO ]: Start isEmpty. Operand 34 states and 138 transitions. [2018-06-24 21:00:32,017 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:00:32,017 INFO ]: Found error trace [2018-06-24 21:00:32,017 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:32,017 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:32,017 INFO ]: Analyzing trace with hash 232432115, now seen corresponding path program 1 times [2018-06-24 21:00:32,017 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:32,017 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:32,018 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:32,018 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:32,026 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:32,062 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:32,062 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:00:32,062 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:00:32,062 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:00:32,062 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:00:32,062 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:32,062 INFO ]: Start difference. First operand 34 states and 138 transitions. Second operand 3 states. [2018-06-24 21:00:32,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:32,183 INFO ]: Finished difference Result 28 states and 54 transitions. [2018-06-24 21:00:32,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:00:32,186 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:00:32,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:32,186 INFO ]: With dead ends: 28 [2018-06-24 21:00:32,186 INFO ]: Without dead ends: 15 [2018-06-24 21:00:32,187 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:00:32,187 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:00:32,188 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-24 21:00:32,188 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:32,188 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 21:00:32,188 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-24 21:00:32,188 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:32,188 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 21:00:32,188 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:00:32,188 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 21:00:32,189 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:32,189 INFO ]: Found error trace [2018-06-24 21:00:32,189 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:32,189 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:32,189 INFO ]: Analyzing trace with hash -1556609752, now seen corresponding path program 1 times [2018-06-24 21:00:32,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:32,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:32,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:32,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:32,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:32,200 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:32,299 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:32,299 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:32,299 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:32,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:32,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:32,342 INFO ]: Computing forward predicates... [2018-06-24 21:00:32,489 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:32,508 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:32,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:00:32,508 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:00:32,508 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:00:32,508 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:32,508 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 10 states. [2018-06-24 21:00:33,089 WARN ]: Spent 530.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-06-24 21:00:33,374 WARN ]: Spent 275.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-06-24 21:00:34,042 WARN ]: Spent 309.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-06-24 21:00:34,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:34,609 INFO ]: Finished difference Result 17 states and 29 transitions. [2018-06-24 21:00:34,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:00:34,609 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:00:34,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:34,609 INFO ]: With dead ends: 17 [2018-06-24 21:00:34,610 INFO ]: Without dead ends: 11 [2018-06-24 21:00:34,610 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2018-06-24 21:00:34,610 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:34,611 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:00:34,611 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:00:34,612 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 21:00:34,612 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 8 [2018-06-24 21:00:34,612 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:34,612 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 21:00:34,612 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:00:34,612 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 21:00:34,612 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:34,612 INFO ]: Found error trace [2018-06-24 21:00:34,612 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:34,612 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:34,612 INFO ]: Analyzing trace with hash -1555954350, now seen corresponding path program 2 times [2018-06-24 21:00:34,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:34,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:34,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:34,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,622 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,678 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,678 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:34,678 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:34,684 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:34,711 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:34,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,712 INFO ]: Computing forward predicates... [2018-06-24 21:00:34,744 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:34,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 21:00:34,765 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:34,765 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:34,765 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:34,765 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2018-06-24 21:00:34,802 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:34,802 INFO ]: Finished difference Result 12 states and 20 transitions. [2018-06-24 21:00:34,802 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:00:34,802 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 21:00:34,802 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:34,802 INFO ]: With dead ends: 12 [2018-06-24 21:00:34,802 INFO ]: Without dead ends: 12 [2018-06-24 21:00:34,802 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:34,802 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:34,803 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:00:34,803 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:34,803 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 21:00:34,803 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-24 21:00:34,803 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:34,803 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 21:00:34,803 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:34,803 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 21:00:34,804 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:00:34,804 INFO ]: Found error trace [2018-06-24 21:00:34,804 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:34,804 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:34,804 INFO ]: Analyzing trace with hash -1555835186, now seen corresponding path program 2 times [2018-06-24 21:00:34,804 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:34,804 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:34,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:34,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:34,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,918 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:34,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:34,918 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:34,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:34,940 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:34,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:34,941 INFO ]: Computing forward predicates... [2018-06-24 21:00:34,988 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,008 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:35,008 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-06-24 21:00:35,008 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:00:35,009 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:00:35,009 INFO ]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:00:35,009 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-06-24 21:00:35,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:35,049 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-24 21:00:35,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:00:35,049 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 21:00:35,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:35,049 INFO ]: With dead ends: 13 [2018-06-24 21:00:35,049 INFO ]: Without dead ends: 13 [2018-06-24 21:00:35,050 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:00:35,050 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:00:35,050 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-24 21:00:35,050 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:35,051 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 21:00:35,051 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-24 21:00:35,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:35,051 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 21:00:35,051 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:00:35,051 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 21:00:35,051 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:35,051 INFO ]: Found error trace [2018-06-24 21:00:35,051 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:35,051 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:35,051 INFO ]: Analyzing trace with hash -990240413, now seen corresponding path program 1 times [2018-06-24 21:00:35,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:35,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,052 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:35,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:35,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,120 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:35,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:35,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:35,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:35,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:35,149 INFO ]: Computing forward predicates... [2018-06-24 21:00:36,540 WARN ]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-06-24 21:00:36,546 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:36,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:36,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:00:36,567 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:00:36,567 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:00:36,567 INFO ]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2018-06-24 21:00:36,567 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 12 states. [2018-06-24 21:00:37,180 WARN ]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-24 21:00:37,964 WARN ]: Spent 670.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-06-24 21:00:38,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:38,542 INFO ]: Finished difference Result 16 states and 24 transitions. [2018-06-24 21:00:38,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:00:38,543 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:00:38,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:38,543 INFO ]: With dead ends: 16 [2018-06-24 21:00:38,543 INFO ]: Without dead ends: 11 [2018-06-24 21:00:38,544 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=51, Invalid=184, Unknown=5, NotChecked=0, Total=240 [2018-06-24 21:00:38,544 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:38,544 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:00:38,544 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:38,545 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-24 21:00:38,545 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 9 [2018-06-24 21:00:38,545 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:38,545 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-24 21:00:38,545 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:00:38,545 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-24 21:00:38,545 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:38,545 INFO ]: Found error trace [2018-06-24 21:00:38,545 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:38,545 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:38,545 INFO ]: Analyzing trace with hash -989316892, now seen corresponding path program 2 times [2018-06-24 21:00:38,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:38,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:38,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:38,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:38,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:38,562 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,720 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:38,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:38,720 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) [2018-06-24 21:00:38,736 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:38,755 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:38,755 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:38,756 INFO ]: Computing forward predicates... [2018-06-24 21:00:40,258 WARN ]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 21:00:40,277 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:40,307 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:40,307 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-24 21:00:40,307 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:00:40,307 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:00:40,307 INFO ]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2018-06-24 21:00:40,307 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 12 states. [2018-06-24 21:00:40,786 WARN ]: Spent 162.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-06-24 21:00:42,487 WARN ]: Spent 345.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-06-24 21:00:43,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:43,118 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-24 21:00:43,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:43,118 INFO ]: Start accepts. Automaton has 12 states. Word has length 9 [2018-06-24 21:00:43,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:43,118 INFO ]: With dead ends: 14 [2018-06-24 21:00:43,118 INFO ]: Without dead ends: 11 [2018-06-24 21:00:43,118 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=46, Invalid=158, Unknown=6, NotChecked=0, Total=210 [2018-06-24 21:00:43,118 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:00:43,119 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 21:00:43,119 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:43,119 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-24 21:00:43,120 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 9 [2018-06-24 21:00:43,120 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:43,120 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-24 21:00:43,120 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:00:43,120 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-24 21:00:43,120 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:43,120 INFO ]: Found error trace [2018-06-24 21:00:43,120 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:43,120 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:43,120 INFO ]: Analyzing trace with hash -988661490, now seen corresponding path program 3 times [2018-06-24 21:00:43,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:43,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:43,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:43,121 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:43,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:43,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:43,209 INFO ]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:43,209 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:43,209 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:43,215 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:43,233 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:00:43,233 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:43,234 INFO ]: Computing forward predicates... [2018-06-24 21:00:43,333 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:43,351 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:43,351 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-24 21:00:43,352 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:43,352 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:43,352 INFO ]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:43,352 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2018-06-24 21:00:44,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:44,375 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-24 21:00:44,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:44,375 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 21:00:44,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:44,375 INFO ]: With dead ends: 12 [2018-06-24 21:00:44,375 INFO ]: Without dead ends: 12 [2018-06-24 21:00:44,375 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:00:44,375 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 21:00:44,376 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 21:00:44,376 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 21:00:44,376 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-24 21:00:44,376 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 9 [2018-06-24 21:00:44,376 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:44,376 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-24 21:00:44,376 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:44,376 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-24 21:00:44,377 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:00:44,377 INFO ]: Found error trace [2018-06-24 21:00:44,377 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:44,377 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:44,377 INFO ]: Analyzing trace with hash -984699287, now seen corresponding path program 1 times [2018-06-24 21:00:44,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:44,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:44,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,377 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:44,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,400 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:44,612 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:44,612 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:44,612 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:44,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:44,643 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:44,645 INFO ]: Computing forward predicates... [2018-06-24 21:00:44,711 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:44,730 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:44,730 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 21:00:44,730 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:00:44,730 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:00:44,730 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:00:44,730 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 7 states. [2018-06-24 21:00:44,817 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:44,818 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-24 21:00:44,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:00:44,818 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 21:00:44,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:44,818 INFO ]: With dead ends: 13 [2018-06-24 21:00:44,818 INFO ]: Without dead ends: 13 [2018-06-24 21:00:44,818 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:00:44,818 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:00:44,819 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-24 21:00:44,819 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 21:00:44,819 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-24 21:00:44,819 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-24 21:00:44,819 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:44,819 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-24 21:00:44,819 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:00:44,819 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-24 21:00:44,819 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:00:44,819 INFO ]: Found error trace [2018-06-24 21:00:44,819 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:44,819 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:44,820 INFO ]: Analyzing trace with hash -584030937, now seen corresponding path program 2 times [2018-06-24 21:00:44,820 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:44,820 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:44,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,820 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:44,820 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:44,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,730 WARN ]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:00:45,731 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:45,731 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:45,731 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:45,745 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:45,784 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:45,784 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:45,786 INFO ]: Computing forward predicates... [2018-06-24 21:00:49,493 WARN ]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-24 21:00:49,496 INFO ]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:00:49,516 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:49,516 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:00:49,516 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:00:49,516 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:00:49,516 INFO ]: CoverageRelationStatistics Valid=44, Invalid=128, Unknown=10, NotChecked=0, Total=182 [2018-06-24 21:00:49,516 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 14 states. [2018-06-24 21:00:56,676 WARN ]: Spent 356.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-06-24 21:01:01,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:01,273 INFO ]: Finished difference Result 16 states and 25 transitions. [2018-06-24 21:01:01,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:01:01,273 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:01:01,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:01,273 INFO ]: With dead ends: 16 [2018-06-24 21:01:01,273 INFO ]: Without dead ends: 13 [2018-06-24 21:01:01,273 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=58, Invalid=198, Unknown=16, NotChecked=0, Total=272 [2018-06-24 21:01:01,273 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:01:01,274 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:01:01,274 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:01:01,274 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 21:01:01,274 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 21:01:01,274 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:01,274 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 21:01:01,274 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:01:01,274 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 21:01:01,274 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:01:01,274 INFO ]: Found error trace [2018-06-24 21:01:01,275 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:01,275 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:01,275 INFO ]: Analyzing trace with hash -583107416, now seen corresponding path program 3 times [2018-06-24 21:01:01,275 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:01,275 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:01,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:01,275 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:01,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:01,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,441 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:01,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:01,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:01,447 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:01:01,499 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:01:01,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,501 INFO ]: Computing forward predicates... [2018-06-24 21:01:01,540 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:01,559 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:01,559 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 21:01:01,559 INFO ]: Interpolant automaton has 9 states [2018-06-24 21:01:01,559 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 21:01:01,559 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:01:01,560 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 9 states. [2018-06-24 21:01:01,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:01,647 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-24 21:01:01,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:01:01,647 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 21:01:01,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:01,647 INFO ]: With dead ends: 17 [2018-06-24 21:01:01,647 INFO ]: Without dead ends: 17 [2018-06-24 21:01:01,647 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:01:01,647 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:01:01,648 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-24 21:01:01,648 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:01:01,648 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-24 21:01:01,648 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-24 21:01:01,648 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:01,648 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-24 21:01:01,648 INFO ]: Interpolant automaton has 9 states. [2018-06-24 21:01:01,648 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-24 21:01:01,649 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:01:01,649 INFO ]: Found error trace [2018-06-24 21:01:01,649 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:01,649 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:01,649 INFO ]: Analyzing trace with hash -580336853, now seen corresponding path program 1 times [2018-06-24 21:01:01,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:01,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:01,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:01,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:01,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:01,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,709 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:01,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:01,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:01,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:01,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:01,734 INFO ]: Computing forward predicates... [2018-06-24 21:01:05,485 WARN ]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-24 21:01:05,487 INFO ]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:05,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:05,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:01:05,506 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:01:05,506 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:01:05,507 INFO ]: CoverageRelationStatistics Valid=44, Invalid=129, Unknown=9, NotChecked=0, Total=182 [2018-06-24 21:01:05,507 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 14 states. [2018-06-24 21:01:07,334 WARN ]: Spent 354.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-06-24 21:01:11,948 WARN ]: Spent 425.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-06-24 21:01:14,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:14,975 INFO ]: Finished difference Result 18 states and 26 transitions. [2018-06-24 21:01:14,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:01:14,975 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:01:14,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:14,975 INFO ]: With dead ends: 18 [2018-06-24 21:01:14,975 INFO ]: Without dead ends: 13 [2018-06-24 21:01:14,976 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=66, Invalid=225, Unknown=15, NotChecked=0, Total=306 [2018-06-24 21:01:14,976 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:01:14,978 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:01:14,978 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:01:14,978 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 21:01:14,979 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-24 21:01:14,979 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:14,979 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 21:01:14,979 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:01:14,979 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 21:01:14,979 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:01:14,979 INFO ]: Found error trace [2018-06-24 21:01:14,979 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:14,979 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:14,979 INFO ]: Analyzing trace with hash -578489811, now seen corresponding path program 2 times [2018-06-24 21:01:14,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:14,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:14,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:14,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:01:14,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:14,990 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:15,342 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 21:01:15,343 INFO ]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:15,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:15,343 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) [2018-06-24 21:01:15,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:15,399 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:01:15,399 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:15,401 INFO ]: Computing forward predicates... [2018-06-24 21:01:15,482 INFO ]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:15,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:15,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-24 21:01:15,501 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:01:15,501 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:01:15,501 INFO ]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:01:15,501 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 13 states. [2018-06-24 21:01:15,637 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:15,637 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-24 21:01:15,638 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:01:15,638 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-24 21:01:15,638 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:15,638 INFO ]: With dead ends: 16 [2018-06-24 21:01:15,638 INFO ]: Without dead ends: 16 [2018-06-24 21:01:15,639 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:01:15,639 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:01:15,640 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-24 21:01:15,640 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:01:15,640 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 21:01:15,640 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2018-06-24 21:01:15,640 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:15,640 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 21:01:15,640 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:01:15,640 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 21:01:15,640 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:01:15,640 INFO ]: Found error trace [2018-06-24 21:01:15,640 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:15,640 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:15,640 INFO ]: Analyzing trace with hash -896756531, now seen corresponding path program 4 times [2018-06-24 21:01:15,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:15,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:15,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:15,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:15,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:15,657 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:15,747 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:15,747 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:15,747 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:15,752 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:01:15,775 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:01:15,775 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:15,777 INFO ]: Computing forward predicates... [2018-06-24 21:01:20,641 WARN ]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-06-24 21:01:20,644 INFO ]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:20,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:20,663 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:01:20,663 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:01:20,663 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:01:20,663 INFO ]: CoverageRelationStatistics Valid=48, Invalid=182, Unknown=10, NotChecked=0, Total=240 [2018-06-24 21:01:20,663 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 16 states. [2018-06-24 21:01:23,522 WARN ]: Spent 657.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-06-24 21:01:27,031 WARN ]: Spent 544.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-06-24 21:01:32,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:01:32,372 INFO ]: Finished difference Result 17 states and 23 transitions. [2018-06-24 21:01:32,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:01:32,372 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-24 21:01:32,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:01:32,372 INFO ]: With dead ends: 17 [2018-06-24 21:01:32,372 INFO ]: Without dead ends: 13 [2018-06-24 21:01:32,372 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=69, Invalid=296, Unknown=15, NotChecked=0, Total=380 [2018-06-24 21:01:32,372 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:01:32,373 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 21:01:32,373 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 21:01:32,373 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-24 21:01:32,373 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 11 [2018-06-24 21:01:32,374 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:01:32,374 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-24 21:01:32,374 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:01:32,374 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-24 21:01:32,374 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:01:32,374 INFO ]: Found error trace [2018-06-24 21:01:32,374 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:01:32,374 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:01:32,374 INFO ]: Analyzing trace with hash -876439069, now seen corresponding path program 3 times [2018-06-24 21:01:32,374 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:01:32,374 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:01:32,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:32,375 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:01:32,375 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:01:32,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:32,563 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:32,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:01:32,563 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:01:32,569 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:01:32,591 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:01:32,591 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:01:32,593 INFO ]: Computing forward predicates... [2018-06-24 21:01:37,757 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-24 21:01:38,374 WARN ]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-24 21:01:38,383 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:01:38,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:01:38,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-24 21:01:38,402 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:01:38,402 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:01:38,402 INFO ]: CoverageRelationStatistics Valid=58, Invalid=169, Unknown=13, NotChecked=0, Total=240 [2018-06-24 21:01:38,402 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 16 states. [2018-06-24 21:01:39,240 WARN ]: Spent 181.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 Received shutdown request... [2018-06-24 21:01:42,062 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:01:42,062 WARN ]: Verification canceled [2018-06-24 21:01:42,064 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:01:42,065 WARN ]: Timeout [2018-06-24 21:01:42,065 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:01:42 BasicIcfg [2018-06-24 21:01:42,065 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:01:42,065 INFO ]: Toolchain (without parser) took 77401.42 ms. Allocated memory was 302.5 MB in the beginning and 557.3 MB in the end (delta: 254.8 MB). Free memory was 256.9 MB in the beginning and 534.1 MB in the end (delta: -277.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:42,066 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:42,066 INFO ]: ChcToBoogie took 67.03 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:42,067 INFO ]: Boogie Preprocessor took 51.82 ms. Allocated memory is still 302.5 MB. Free memory is still 252.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:42,067 INFO ]: RCFGBuilder took 454.21 ms. Allocated memory is still 302.5 MB. Free memory was 250.9 MB in the beginning and 236.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:42,067 INFO ]: BlockEncodingV2 took 83.23 ms. Allocated memory is still 302.5 MB. Free memory was 236.9 MB in the beginning and 235.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:01:42,067 INFO ]: TraceAbstraction took 76736.12 ms. Allocated memory was 302.5 MB in the beginning and 557.3 MB in the end (delta: 254.8 MB). Free memory was 235.0 MB in the beginning and 534.1 MB in the end (delta: -299.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:01:42,069 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 20 edges - StatisticsResult: Encoded RCFG 6 locations, 16 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.03 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.82 ms. Allocated memory is still 302.5 MB. Free memory is still 252.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 454.21 ms. Allocated memory is still 302.5 MB. Free memory was 250.9 MB in the beginning and 236.9 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 83.23 ms. Allocated memory is still 302.5 MB. Free memory was 236.9 MB in the beginning and 235.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 76736.12 ms. Allocated memory was 302.5 MB in the beginning and 557.3 MB in the end (delta: 254.8 MB). Free memory was 235.0 MB in the beginning and 534.1 MB in the end (delta: -299.2 MB). There was no memory consumed. 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 (13states) and interpolant automaton (currently 8 states, 16 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 17 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 76.6s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 48.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 24 SDslu, 358 SDs, 0 SdLazy, 1655 SolverSat, 463 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 128 SyntacticMatches, 11 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 44.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 71 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 332 ConstructedInterpolants, 49 QuantifiedInterpolants, 19774 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3325 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 47 InterpolantComputations, 8 PerfectInterpolantSequences, 58/360 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/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-01-42-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-01-42-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-01-42-079.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/008b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-01-42-079.csv Completed graceful shutdown