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/006b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:59:13,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:59:13,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:59:13,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:59:13,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:59:13,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:59:13,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:59:13,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:59:13,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:59:13,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:59:13,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:59:13,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:59:13,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:59:13,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:59:13,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:59:13,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:59:13,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:59:13,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:59:13,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:59:13,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:59:13,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:59:13,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:59:13,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:59:13,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:59:13,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:59:13,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:59:13,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:59:13,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:59:13,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:59:13,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:59:13,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:59:13,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:59:13,185 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:59:13,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:59:13,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:59:13,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:59:13,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:59:13,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:59:13,201 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:59:13,201 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:59:13,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:59:13,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:59:13,202 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:59:13,202 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:59:13,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:59:13,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:59:13,203 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:59:13,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:59:13,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:59:13,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:59:13,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:59:13,205 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:59:13,206 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:59:13,206 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:59:13,256 INFO ]: Repository-Root is: /tmp [2018-06-24 20:59:13,271 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:59:13,276 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:59:13,278 INFO ]: Initializing SmtParser... [2018-06-24 20:59:13,278 INFO ]: SmtParser initialized [2018-06-24 20:59:13,279 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/006b-horn.smt2 [2018-06-24 20:59:13,280 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:59:13,368 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006b-horn.smt2 unknown [2018-06-24 20:59:13,615 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006b-horn.smt2 [2018-06-24 20:59:13,621 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:59:13,626 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:59:13,627 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:59:13,627 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:59:13,627 INFO ]: ChcToBoogie initialized [2018-06-24 20:59:13,630 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,683 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13 Unit [2018-06-24 20:59:13,683 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:59:13,684 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:59:13,684 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:59:13,684 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:59:13,703 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,703 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,711 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,711 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,731 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,733 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,735 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... [2018-06-24 20:59:13,737 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:59:13,737 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:59:13,737 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:59:13,737 INFO ]: RCFGBuilder initialized [2018-06-24 20:59:13,738 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:59:13,763 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:59:13,763 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:59:13,763 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:59:13,763 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:59:13,763 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:59:13,763 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:59:14,355 INFO ]: Using library mode [2018-06-24 20:59:14,356 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:14 BoogieIcfgContainer [2018-06-24 20:59:14,356 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:59:14,356 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:59:14,356 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:59:14,357 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:59:14,358 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:14" (1/1) ... [2018-06-24 20:59:14,375 INFO ]: Initial Icfg 35 locations, 58 edges [2018-06-24 20:59:14,377 INFO ]: Using Remove infeasible edges [2018-06-24 20:59:14,378 INFO ]: Using Maximize final states [2018-06-24 20:59:14,378 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:59:14,378 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:59:14,380 INFO ]: Using Remove sink states [2018-06-24 20:59:14,383 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:59:14,383 INFO ]: Using Use SBE [2018-06-24 20:59:14,394 INFO ]: SBE split 0 edges [2018-06-24 20:59:14,403 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:59:14,406 INFO ]: 0 new accepting states [2018-06-24 20:59:14,521 INFO ]: Removed 13 edges and 5 locations by large block encoding [2018-06-24 20:59:14,523 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:59:14,524 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:59:14,524 INFO ]: 0 new accepting states [2018-06-24 20:59:14,525 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:59:14,525 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:59:14,526 INFO ]: Encoded RCFG 28 locations, 51 edges [2018-06-24 20:59:14,526 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:59:14 BasicIcfg [2018-06-24 20:59:14,526 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:59:14,527 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:59:14,527 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:59:14,530 INFO ]: TraceAbstraction initialized [2018-06-24 20:59:14,530 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:59:13" (1/4) ... [2018-06-24 20:59:14,532 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543bfd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:59:14, skipping insertion in model container [2018-06-24 20:59:14,532 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:13" (2/4) ... [2018-06-24 20:59:14,532 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543bfd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:59:14, skipping insertion in model container [2018-06-24 20:59:14,533 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:14" (3/4) ... [2018-06-24 20:59:14,533 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543bfd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:59:14, skipping insertion in model container [2018-06-24 20:59:14,533 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:59:14" (4/4) ... [2018-06-24 20:59:14,535 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:59:14,545 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:59:14,552 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:59:14,594 INFO ]: Using default assertion order modulation [2018-06-24 20:59:14,595 INFO ]: Interprodecural is true [2018-06-24 20:59:14,595 INFO ]: Hoare is false [2018-06-24 20:59:14,595 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:59:14,595 INFO ]: Backedges is TWOTRACK [2018-06-24 20:59:14,595 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:59:14,595 INFO ]: Difference is false [2018-06-24 20:59:14,595 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:59:14,595 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:59:14,604 INFO ]: Start isEmpty. Operand 28 states. [2018-06-24 20:59:14,616 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:59:14,616 INFO ]: Found error trace [2018-06-24 20:59:14,617 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:59:14,617 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:14,622 INFO ]: Analyzing trace with hash 36081402, now seen corresponding path program 1 times [2018-06-24 20:59:14,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:14,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:14,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:14,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:14,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:14,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:14,757 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:59:14,759 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:59:14,759 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:59:14,760 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:14,770 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:14,770 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:14,772 INFO ]: Start difference. First operand 28 states. Second operand 3 states. [2018-06-24 20:59:15,050 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:15,050 INFO ]: Finished difference Result 34 states and 64 transitions. [2018-06-24 20:59:15,050 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:15,051 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:59:15,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:15,061 INFO ]: With dead ends: 34 [2018-06-24 20:59:15,061 INFO ]: Without dead ends: 34 [2018-06-24 20:59:15,062 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:15,076 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:59:15,120 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:59:15,121 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:59:15,126 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2018-06-24 20:59:15,127 INFO ]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 5 [2018-06-24 20:59:15,128 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:15,128 INFO ]: Abstraction has 34 states and 64 transitions. [2018-06-24 20:59:15,128 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:15,128 INFO ]: Start isEmpty. Operand 34 states and 64 transitions. [2018-06-24 20:59:15,139 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:59:15,139 INFO ]: Found error trace [2018-06-24 20:59:15,139 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:15,139 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:15,139 INFO ]: Analyzing trace with hash -1783233774, now seen corresponding path program 1 times [2018-06-24 20:59:15,139 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:15,139 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:15,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:15,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:15,140 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:15,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,263 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:59:15,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:15,264 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 20:59:15,274 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 20:59:15,344 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,352 INFO ]: Computing forward predicates... [2018-06-24 20:59:15,375 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:59:15,408 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:15,408 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 20:59:15,408 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:15,408 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:15,409 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:15,409 INFO ]: Start difference. First operand 34 states and 64 transitions. Second operand 3 states. [2018-06-24 20:59:15,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:15,727 INFO ]: Finished difference Result 40 states and 73 transitions. [2018-06-24 20:59:15,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:15,727 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-24 20:59:15,727 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:15,729 INFO ]: With dead ends: 40 [2018-06-24 20:59:15,729 INFO ]: Without dead ends: 40 [2018-06-24 20:59:15,730 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:15,730 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:59:15,737 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:59:15,737 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:59:15,739 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2018-06-24 20:59:15,739 INFO ]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 14 [2018-06-24 20:59:15,739 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:15,739 INFO ]: Abstraction has 40 states and 73 transitions. [2018-06-24 20:59:15,739 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:15,739 INFO ]: Start isEmpty. Operand 40 states and 73 transitions. [2018-06-24 20:59:15,744 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:59:15,744 INFO ]: Found error trace [2018-06-24 20:59:15,744 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:15,744 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:15,745 INFO ]: Analyzing trace with hash 338607566, now seen corresponding path program 1 times [2018-06-24 20:59:15,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:15,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:15,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:15,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:15,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:15,762 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,810 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:59:15,810 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:15,810 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:15,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:15,881 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:15,883 INFO ]: Computing forward predicates... [2018-06-24 20:59:15,889 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:59:15,922 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:15,922 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 20:59:15,923 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:15,923 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:15,923 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:15,923 INFO ]: Start difference. First operand 40 states and 73 transitions. Second operand 3 states. [2018-06-24 20:59:16,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:16,337 INFO ]: Finished difference Result 53 states and 98 transitions. [2018-06-24 20:59:16,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:16,340 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 20:59:16,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:16,342 INFO ]: With dead ends: 53 [2018-06-24 20:59:16,342 INFO ]: Without dead ends: 53 [2018-06-24 20:59:16,342 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:16,343 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:59:16,353 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-06-24 20:59:16,354 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-24 20:59:16,358 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 98 transitions. [2018-06-24 20:59:16,358 INFO ]: Start accepts. Automaton has 53 states and 98 transitions. Word has length 16 [2018-06-24 20:59:16,360 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:16,360 INFO ]: Abstraction has 53 states and 98 transitions. [2018-06-24 20:59:16,360 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:16,360 INFO ]: Start isEmpty. Operand 53 states and 98 transitions. [2018-06-24 20:59:16,363 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:59:16,363 INFO ]: Found error trace [2018-06-24 20:59:16,363 INFO ]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:16,363 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:16,363 INFO ]: Analyzing trace with hash -976050745, now seen corresponding path program 1 times [2018-06-24 20:59:16,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:16,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:16,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:16,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:16,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:16,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:16,657 INFO ]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 20:59:16,657 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:16,657 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:16,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:16,723 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:16,727 INFO ]: Computing forward predicates... [2018-06-24 20:59:16,783 INFO ]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:59:16,802 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:16,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:59:16,802 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:59:16,802 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:59:16,803 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:59:16,803 INFO ]: Start difference. First operand 53 states and 98 transitions. Second operand 9 states. [2018-06-24 20:59:17,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:17,774 INFO ]: Finished difference Result 89 states and 205 transitions. [2018-06-24 20:59:17,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:59:17,775 INFO ]: Start accepts. Automaton has 9 states. Word has length 22 [2018-06-24 20:59:17,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:17,781 INFO ]: With dead ends: 89 [2018-06-24 20:59:17,781 INFO ]: Without dead ends: 88 [2018-06-24 20:59:17,781 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:59:17,781 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-24 20:59:17,802 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 61. [2018-06-24 20:59:17,802 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-24 20:59:17,804 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 125 transitions. [2018-06-24 20:59:17,804 INFO ]: Start accepts. Automaton has 61 states and 125 transitions. Word has length 22 [2018-06-24 20:59:17,804 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:17,804 INFO ]: Abstraction has 61 states and 125 transitions. [2018-06-24 20:59:17,804 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:59:17,804 INFO ]: Start isEmpty. Operand 61 states and 125 transitions. [2018-06-24 20:59:17,807 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:17,807 INFO ]: Found error trace [2018-06-24 20:59:17,807 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:17,807 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:17,808 INFO ]: Analyzing trace with hash 1443982809, now seen corresponding path program 1 times [2018-06-24 20:59:17,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:17,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:17,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:17,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:17,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:17,843 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:18,154 INFO ]: Checked inductivity of 33 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 20:59:18,155 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:18,155 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:18,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:18,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:18,226 INFO ]: Computing forward predicates... [2018-06-24 20:59:18,539 INFO ]: Checked inductivity of 33 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 20:59:18,572 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:18,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-06-24 20:59:18,573 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:59:18,573 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:59:18,573 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:59:18,574 INFO ]: Start difference. First operand 61 states and 125 transitions. Second operand 25 states. [2018-06-24 20:59:24,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:24,977 INFO ]: Finished difference Result 208 states and 574 transitions. [2018-06-24 20:59:24,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-06-24 20:59:24,977 INFO ]: Start accepts. Automaton has 25 states. Word has length 28 [2018-06-24 20:59:24,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:24,987 INFO ]: With dead ends: 208 [2018-06-24 20:59:24,987 INFO ]: Without dead ends: 206 [2018-06-24 20:59:24,989 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=757, Invalid=5249, Unknown=0, NotChecked=0, Total=6006 [2018-06-24 20:59:24,989 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-24 20:59:25,048 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 147. [2018-06-24 20:59:25,048 INFO ]: Start removeUnreachable. Operand 147 states. [2018-06-24 20:59:25,056 INFO ]: Finished removeUnreachable. Reduced from 147 states to 147 states and 356 transitions. [2018-06-24 20:59:25,056 INFO ]: Start accepts. Automaton has 147 states and 356 transitions. Word has length 28 [2018-06-24 20:59:25,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:25,056 INFO ]: Abstraction has 147 states and 356 transitions. [2018-06-24 20:59:25,056 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:59:25,056 INFO ]: Start isEmpty. Operand 147 states and 356 transitions. [2018-06-24 20:59:25,066 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:25,066 INFO ]: Found error trace [2018-06-24 20:59:25,066 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:25,067 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:25,067 INFO ]: Analyzing trace with hash -1244783491, now seen corresponding path program 1 times [2018-06-24 20:59:25,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:25,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:25,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:25,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:25,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:25,110 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:25,179 INFO ]: Checked inductivity of 33 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 20:59:25,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:25,179 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:25,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:25,245 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:25,248 INFO ]: Computing forward predicates... [2018-06-24 20:59:25,329 INFO ]: Checked inductivity of 33 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:59:25,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:25,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-06-24 20:59:25,348 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:25,349 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:25,349 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:25,349 INFO ]: Start difference. First operand 147 states and 356 transitions. Second operand 13 states. [2018-06-24 20:59:26,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:26,346 INFO ]: Finished difference Result 265 states and 669 transitions. [2018-06-24 20:59:26,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:59:26,347 INFO ]: Start accepts. Automaton has 13 states. Word has length 28 [2018-06-24 20:59:26,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:26,354 INFO ]: With dead ends: 265 [2018-06-24 20:59:26,354 INFO ]: Without dead ends: 256 [2018-06-24 20:59:26,355 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:59:26,355 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-24 20:59:26,398 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 151. [2018-06-24 20:59:26,399 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-24 20:59:26,403 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 362 transitions. [2018-06-24 20:59:26,403 INFO ]: Start accepts. Automaton has 151 states and 362 transitions. Word has length 28 [2018-06-24 20:59:26,403 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:26,403 INFO ]: Abstraction has 151 states and 362 transitions. [2018-06-24 20:59:26,404 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:26,404 INFO ]: Start isEmpty. Operand 151 states and 362 transitions. [2018-06-24 20:59:26,415 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:26,415 INFO ]: Found error trace [2018-06-24 20:59:26,415 INFO ]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:26,415 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:26,415 INFO ]: Analyzing trace with hash 1391856646, now seen corresponding path program 1 times [2018-06-24 20:59:26,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:26,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:26,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:26,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:26,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:26,444 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:27,063 INFO ]: Checked inductivity of 33 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 20:59:27,064 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:27,064 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:27,071 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:27,109 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:27,112 INFO ]: Computing forward predicates... [2018-06-24 20:59:27,411 INFO ]: Checked inductivity of 33 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:59:27,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:27,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:59:27,442 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:27,442 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:27,442 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:27,442 INFO ]: Start difference. First operand 151 states and 362 transitions. Second operand 13 states. [2018-06-24 20:59:28,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:28,323 INFO ]: Finished difference Result 293 states and 792 transitions. [2018-06-24 20:59:28,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:59:28,326 INFO ]: Start accepts. Automaton has 13 states. Word has length 28 [2018-06-24 20:59:28,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:28,333 INFO ]: With dead ends: 293 [2018-06-24 20:59:28,333 INFO ]: Without dead ends: 293 [2018-06-24 20:59:28,333 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:59:28,333 INFO ]: Start minimizeSevpa. Operand 293 states. [2018-06-24 20:59:28,371 INFO ]: Finished minimizeSevpa. Reduced states from 293 to 191. [2018-06-24 20:59:28,371 INFO ]: Start removeUnreachable. Operand 191 states. [2018-06-24 20:59:28,377 INFO ]: Finished removeUnreachable. Reduced from 191 states to 191 states and 486 transitions. [2018-06-24 20:59:28,377 INFO ]: Start accepts. Automaton has 191 states and 486 transitions. Word has length 28 [2018-06-24 20:59:28,377 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:28,377 INFO ]: Abstraction has 191 states and 486 transitions. [2018-06-24 20:59:28,377 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:28,377 INFO ]: Start isEmpty. Operand 191 states and 486 transitions. [2018-06-24 20:59:28,387 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:28,387 INFO ]: Found error trace [2018-06-24 20:59:28,387 INFO ]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:28,388 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:28,388 INFO ]: Analyzing trace with hash -141504379, now seen corresponding path program 1 times [2018-06-24 20:59:28,388 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:28,388 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:28,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:28,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:28,388 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:28,427 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:28,628 INFO ]: Checked inductivity of 49 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:59:28,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:28,629 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:28,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:28,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:28,681 INFO ]: Computing forward predicates... [2018-06-24 20:59:28,721 INFO ]: Checked inductivity of 49 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 20:59:28,743 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:28,743 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:59:28,743 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:59:28,743 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:59:28,743 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:59:28,743 INFO ]: Start difference. First operand 191 states and 486 transitions. Second operand 11 states. [2018-06-24 20:59:29,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:29,102 INFO ]: Finished difference Result 291 states and 769 transitions. [2018-06-24 20:59:29,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:59:29,103 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-24 20:59:29,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:29,109 INFO ]: With dead ends: 291 [2018-06-24 20:59:29,109 INFO ]: Without dead ends: 291 [2018-06-24 20:59:29,109 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:59:29,109 INFO ]: Start minimizeSevpa. Operand 291 states. [2018-06-24 20:59:29,131 INFO ]: Finished minimizeSevpa. Reduced states from 291 to 222. [2018-06-24 20:59:29,131 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-24 20:59:29,135 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 576 transitions. [2018-06-24 20:59:29,136 INFO ]: Start accepts. Automaton has 222 states and 576 transitions. Word has length 33 [2018-06-24 20:59:29,136 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:29,136 INFO ]: Abstraction has 222 states and 576 transitions. [2018-06-24 20:59:29,136 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:59:29,136 INFO ]: Start isEmpty. Operand 222 states and 576 transitions. [2018-06-24 20:59:29,143 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:29,143 INFO ]: Found error trace [2018-06-24 20:59:29,143 INFO ]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:29,143 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:29,143 INFO ]: Analyzing trace with hash 946126792, now seen corresponding path program 1 times [2018-06-24 20:59:29,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:29,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:29,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:29,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:29,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:29,165 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:29,336 INFO ]: Checked inductivity of 49 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:59:29,336 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:29,336 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:29,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:29,390 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:29,393 INFO ]: Computing forward predicates... [2018-06-24 20:59:29,465 INFO ]: Checked inductivity of 49 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 20:59:29,484 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:29,484 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:59:29,485 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:59:29,485 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:59:29,485 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:59:29,485 INFO ]: Start difference. First operand 222 states and 576 transitions. Second operand 11 states. [2018-06-24 20:59:29,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:29,936 INFO ]: Finished difference Result 267 states and 694 transitions. [2018-06-24 20:59:29,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:59:29,936 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-24 20:59:29,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:29,941 INFO ]: With dead ends: 267 [2018-06-24 20:59:29,941 INFO ]: Without dead ends: 261 [2018-06-24 20:59:29,941 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:59:29,942 INFO ]: Start minimizeSevpa. Operand 261 states. [2018-06-24 20:59:29,972 INFO ]: Finished minimizeSevpa. Reduced states from 261 to 216. [2018-06-24 20:59:29,972 INFO ]: Start removeUnreachable. Operand 216 states. [2018-06-24 20:59:29,975 INFO ]: Finished removeUnreachable. Reduced from 216 states to 216 states and 560 transitions. [2018-06-24 20:59:29,975 INFO ]: Start accepts. Automaton has 216 states and 560 transitions. Word has length 33 [2018-06-24 20:59:29,975 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:29,975 INFO ]: Abstraction has 216 states and 560 transitions. [2018-06-24 20:59:29,975 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:59:29,975 INFO ]: Start isEmpty. Operand 216 states and 560 transitions. [2018-06-24 20:59:29,982 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:59:29,982 INFO ]: Found error trace [2018-06-24 20:59:29,982 INFO ]: trace histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:29,982 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:29,983 INFO ]: Analyzing trace with hash 2051143876, now seen corresponding path program 1 times [2018-06-24 20:59:29,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:29,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:29,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:29,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:29,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:30,006 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:30,287 INFO ]: Checked inductivity of 70 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 20:59:30,287 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:30,287 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:30,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:30,372 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:30,377 INFO ]: Computing forward predicates... [2018-06-24 20:59:30,646 INFO ]: Checked inductivity of 70 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 20:59:30,665 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:30,665 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2018-06-24 20:59:30,666 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:59:30,666 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:59:30,666 INFO ]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:59:30,666 INFO ]: Start difference. First operand 216 states and 560 transitions. Second operand 24 states. [2018-06-24 20:59:36,758 WARN ]: Spent 247.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-06-24 20:59:38,177 WARN ]: Spent 216.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-06-24 20:59:39,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:39,229 INFO ]: Finished difference Result 1076 states and 3590 transitions. [2018-06-24 20:59:39,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-06-24 20:59:39,230 INFO ]: Start accepts. Automaton has 24 states. Word has length 39 [2018-06-24 20:59:39,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:39,254 INFO ]: With dead ends: 1076 [2018-06-24 20:59:39,254 INFO ]: Without dead ends: 811 [2018-06-24 20:59:39,260 INFO ]: 0 DeclaredPredicates, 233 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9080 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2831, Invalid=21975, Unknown=0, NotChecked=0, Total=24806 [2018-06-24 20:59:39,261 INFO ]: Start minimizeSevpa. Operand 811 states. [2018-06-24 20:59:39,375 INFO ]: Finished minimizeSevpa. Reduced states from 811 to 390. [2018-06-24 20:59:39,375 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-24 20:59:39,382 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1105 transitions. [2018-06-24 20:59:39,382 INFO ]: Start accepts. Automaton has 390 states and 1105 transitions. Word has length 39 [2018-06-24 20:59:39,382 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:39,382 INFO ]: Abstraction has 390 states and 1105 transitions. [2018-06-24 20:59:39,383 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:59:39,383 INFO ]: Start isEmpty. Operand 390 states and 1105 transitions. [2018-06-24 20:59:39,395 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:59:39,395 INFO ]: Found error trace [2018-06-24 20:59:39,395 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:39,395 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:39,398 INFO ]: Analyzing trace with hash -1334378453, now seen corresponding path program 2 times [2018-06-24 20:59:39,399 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:39,399 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:39,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:39,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:39,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:39,426 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:39,554 INFO ]: Checked inductivity of 53 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 20:59:39,554 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:39,554 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:39,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:59:39,609 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:59:39,609 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:39,612 INFO ]: Computing forward predicates... [2018-06-24 20:59:39,754 INFO ]: Checked inductivity of 53 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-24 20:59:39,782 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:39,782 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-06-24 20:59:39,782 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:59:39,782 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:59:39,783 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:59:39,783 INFO ]: Start difference. First operand 390 states and 1105 transitions. Second operand 18 states. [2018-06-24 20:59:40,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:40,779 INFO ]: Finished difference Result 589 states and 1910 transitions. [2018-06-24 20:59:40,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:59:40,782 INFO ]: Start accepts. Automaton has 18 states. Word has length 34 [2018-06-24 20:59:40,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:40,797 INFO ]: With dead ends: 589 [2018-06-24 20:59:40,797 INFO ]: Without dead ends: 589 [2018-06-24 20:59:40,798 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:59:40,798 INFO ]: Start minimizeSevpa. Operand 589 states. [2018-06-24 20:59:40,861 INFO ]: Finished minimizeSevpa. Reduced states from 589 to 400. [2018-06-24 20:59:40,861 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:59:40,869 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1166 transitions. [2018-06-24 20:59:40,869 INFO ]: Start accepts. Automaton has 400 states and 1166 transitions. Word has length 34 [2018-06-24 20:59:40,869 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:40,869 INFO ]: Abstraction has 400 states and 1166 transitions. [2018-06-24 20:59:40,869 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:59:40,869 INFO ]: Start isEmpty. Operand 400 states and 1166 transitions. [2018-06-24 20:59:40,878 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:40,878 INFO ]: Found error trace [2018-06-24 20:59:40,879 INFO ]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:40,879 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:40,879 INFO ]: Analyzing trace with hash 99497243, now seen corresponding path program 1 times [2018-06-24 20:59:40,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:40,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:40,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:40,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:40,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:40,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:41,391 INFO ]: Checked inductivity of 49 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:59:41,391 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:41,391 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) [2018-06-24 20:59:41,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:41,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:41,463 INFO ]: Computing forward predicates... [2018-06-24 20:59:41,473 INFO ]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 20:59:41,492 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:41,492 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2018-06-24 20:59:41,492 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:59:41,492 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:59:41,492 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:59:41,493 INFO ]: Start difference. First operand 400 states and 1166 transitions. Second operand 7 states. [2018-06-24 20:59:42,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:42,525 INFO ]: Finished difference Result 479 states and 1387 transitions. [2018-06-24 20:59:42,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:59:42,529 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-24 20:59:42,530 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:42,539 INFO ]: With dead ends: 479 [2018-06-24 20:59:42,539 INFO ]: Without dead ends: 440 [2018-06-24 20:59:42,539 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:59:42,539 INFO ]: Start minimizeSevpa. Operand 440 states. [2018-06-24 20:59:42,585 INFO ]: Finished minimizeSevpa. Reduced states from 440 to 349. [2018-06-24 20:59:42,585 INFO ]: Start removeUnreachable. Operand 349 states. [2018-06-24 20:59:42,591 INFO ]: Finished removeUnreachable. Reduced from 349 states to 349 states and 990 transitions. [2018-06-24 20:59:42,591 INFO ]: Start accepts. Automaton has 349 states and 990 transitions. Word has length 33 [2018-06-24 20:59:42,591 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:42,591 INFO ]: Abstraction has 349 states and 990 transitions. [2018-06-24 20:59:42,591 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:59:42,591 INFO ]: Start isEmpty. Operand 349 states and 990 transitions. [2018-06-24 20:59:42,597 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:59:42,597 INFO ]: Found error trace [2018-06-24 20:59:42,597 INFO ]: trace histogram [8, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:42,597 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:42,597 INFO ]: Analyzing trace with hash 1722769708, now seen corresponding path program 1 times [2018-06-24 20:59:42,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:42,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:42,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:42,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:42,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:42,621 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:42,911 INFO ]: Checked inductivity of 97 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-24 20:59:42,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:42,911 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:42,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:42,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:42,979 INFO ]: Computing forward predicates... [2018-06-24 20:59:43,023 INFO ]: Checked inductivity of 97 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-24 20:59:43,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:43,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:59:43,043 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:43,043 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:43,043 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:43,044 INFO ]: Start difference. First operand 349 states and 990 transitions. Second operand 13 states. [2018-06-24 20:59:43,392 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 20:59:43,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:43,620 INFO ]: Finished difference Result 465 states and 1341 transitions. [2018-06-24 20:59:43,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:59:43,620 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-24 20:59:43,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:43,628 INFO ]: With dead ends: 465 [2018-06-24 20:59:43,628 INFO ]: Without dead ends: 462 [2018-06-24 20:59:43,628 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:59:43,629 INFO ]: Start minimizeSevpa. Operand 462 states. [2018-06-24 20:59:43,669 INFO ]: Finished minimizeSevpa. Reduced states from 462 to 406. [2018-06-24 20:59:43,670 INFO ]: Start removeUnreachable. Operand 406 states. [2018-06-24 20:59:43,675 INFO ]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1195 transitions. [2018-06-24 20:59:43,675 INFO ]: Start accepts. Automaton has 406 states and 1195 transitions. Word has length 45 [2018-06-24 20:59:43,675 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:43,675 INFO ]: Abstraction has 406 states and 1195 transitions. [2018-06-24 20:59:43,675 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:43,675 INFO ]: Start isEmpty. Operand 406 states and 1195 transitions. [2018-06-24 20:59:43,683 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:59:43,683 INFO ]: Found error trace [2018-06-24 20:59:43,683 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:43,683 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:43,683 INFO ]: Analyzing trace with hash -167756483, now seen corresponding path program 3 times [2018-06-24 20:59:43,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:43,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:43,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:43,684 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:43,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:43,702 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:44,177 INFO ]: Checked inductivity of 79 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-24 20:59:44,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:44,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:44,183 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:59:44,308 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:59:44,308 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:44,312 INFO ]: Computing forward predicates... [2018-06-24 20:59:44,495 INFO ]: Checked inductivity of 79 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 20:59:44,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:44,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-06-24 20:59:44,515 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:59:44,516 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:59:44,516 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:59:44,516 INFO ]: Start difference. First operand 406 states and 1195 transitions. Second operand 17 states. [2018-06-24 20:59:45,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:45,819 INFO ]: Finished difference Result 675 states and 1933 transitions. [2018-06-24 20:59:45,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:59:45,820 INFO ]: Start accepts. Automaton has 17 states. Word has length 40 [2018-06-24 20:59:45,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:45,828 INFO ]: With dead ends: 675 [2018-06-24 20:59:45,828 INFO ]: Without dead ends: 665 [2018-06-24 20:59:45,828 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:59:45,829 INFO ]: Start minimizeSevpa. Operand 665 states. [2018-06-24 20:59:45,900 INFO ]: Finished minimizeSevpa. Reduced states from 665 to 444. [2018-06-24 20:59:45,900 INFO ]: Start removeUnreachable. Operand 444 states. [2018-06-24 20:59:45,906 INFO ]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1221 transitions. [2018-06-24 20:59:45,906 INFO ]: Start accepts. Automaton has 444 states and 1221 transitions. Word has length 40 [2018-06-24 20:59:45,906 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:45,906 INFO ]: Abstraction has 444 states and 1221 transitions. [2018-06-24 20:59:45,906 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:59:45,906 INFO ]: Start isEmpty. Operand 444 states and 1221 transitions. [2018-06-24 20:59:45,913 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:59:45,913 INFO ]: Found error trace [2018-06-24 20:59:45,913 INFO ]: trace histogram [7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:45,913 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:45,913 INFO ]: Analyzing trace with hash -915026854, now seen corresponding path program 1 times [2018-06-24 20:59:45,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:45,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:45,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:45,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:45,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:45,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:46,091 INFO ]: Checked inductivity of 70 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:59:46,091 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:46,091 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:46,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:46,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:46,150 INFO ]: Computing forward predicates... [2018-06-24 20:59:46,181 INFO ]: Checked inductivity of 70 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 20:59:46,205 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:46,205 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:59:46,205 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:59:46,205 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:59:46,205 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:59:46,205 INFO ]: Start difference. First operand 444 states and 1221 transitions. Second operand 9 states. [2018-06-24 20:59:46,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:46,428 INFO ]: Finished difference Result 393 states and 1096 transitions. [2018-06-24 20:59:46,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:59:46,428 INFO ]: Start accepts. Automaton has 9 states. Word has length 39 [2018-06-24 20:59:46,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:46,433 INFO ]: With dead ends: 393 [2018-06-24 20:59:46,433 INFO ]: Without dead ends: 393 [2018-06-24 20:59:46,433 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:59:46,433 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-24 20:59:46,464 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 361. [2018-06-24 20:59:46,464 INFO ]: Start removeUnreachable. Operand 361 states. [2018-06-24 20:59:46,468 INFO ]: Finished removeUnreachable. Reduced from 361 states to 361 states and 991 transitions. [2018-06-24 20:59:46,468 INFO ]: Start accepts. Automaton has 361 states and 991 transitions. Word has length 39 [2018-06-24 20:59:46,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:46,468 INFO ]: Abstraction has 361 states and 991 transitions. [2018-06-24 20:59:46,468 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:59:46,468 INFO ]: Start isEmpty. Operand 361 states and 991 transitions. [2018-06-24 20:59:46,475 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:59:46,475 INFO ]: Found error trace [2018-06-24 20:59:46,475 INFO ]: trace histogram [8, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:46,475 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:46,475 INFO ]: Analyzing trace with hash 881028559, now seen corresponding path program 1 times [2018-06-24 20:59:46,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:46,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:46,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:46,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,500 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:47,000 INFO ]: Checked inductivity of 105 backedges. 45 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-24 20:59:47,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:47,000 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:47,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:47,072 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:47,075 INFO ]: Computing forward predicates... [2018-06-24 20:59:47,269 INFO ]: Checked inductivity of 105 backedges. 55 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-24 20:59:47,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:47,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-06-24 20:59:47,303 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:59:47,303 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:59:47,303 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:59:47,303 INFO ]: Start difference. First operand 361 states and 991 transitions. Second operand 25 states. [2018-06-24 20:59:48,902 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-24 20:59:51,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:51,145 INFO ]: Finished difference Result 556 states and 1678 transitions. [2018-06-24 20:59:51,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 20:59:51,164 INFO ]: Start accepts. Automaton has 25 states. Word has length 46 [2018-06-24 20:59:51,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:51,170 INFO ]: With dead ends: 556 [2018-06-24 20:59:51,170 INFO ]: Without dead ends: 511 [2018-06-24 20:59:51,171 INFO ]: 0 DeclaredPredicates, 152 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=764, Invalid=6892, Unknown=0, NotChecked=0, Total=7656 [2018-06-24 20:59:51,172 INFO ]: Start minimizeSevpa. Operand 511 states. [2018-06-24 20:59:51,234 INFO ]: Finished minimizeSevpa. Reduced states from 511 to 383. [2018-06-24 20:59:51,234 INFO ]: Start removeUnreachable. Operand 383 states. [2018-06-24 20:59:51,245 INFO ]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1080 transitions. [2018-06-24 20:59:51,245 INFO ]: Start accepts. Automaton has 383 states and 1080 transitions. Word has length 46 [2018-06-24 20:59:51,245 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:51,245 INFO ]: Abstraction has 383 states and 1080 transitions. [2018-06-24 20:59:51,245 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:59:51,245 INFO ]: Start isEmpty. Operand 383 states and 1080 transitions. [2018-06-24 20:59:51,251 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 20:59:51,251 INFO ]: Found error trace [2018-06-24 20:59:51,251 INFO ]: trace histogram [9, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:51,251 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:51,252 INFO ]: Analyzing trace with hash 1422698494, now seen corresponding path program 1 times [2018-06-24 20:59:51,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:51,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:51,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:51,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:51,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:51,280 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:51,529 INFO ]: Checked inductivity of 126 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-24 20:59:51,529 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:51,529 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:51,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:51,603 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:51,607 INFO ]: Computing forward predicates... [2018-06-24 20:59:51,695 INFO ]: Checked inductivity of 126 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 20:59:51,714 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:51,714 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2018-06-24 20:59:51,714 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:59:51,714 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:59:51,714 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:59:51,715 INFO ]: Start difference. First operand 383 states and 1080 transitions. Second operand 23 states. [2018-06-24 20:59:54,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:54,970 INFO ]: Finished difference Result 688 states and 2156 transitions. [2018-06-24 20:59:54,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-06-24 20:59:54,970 INFO ]: Start accepts. Automaton has 23 states. Word has length 51 [2018-06-24 20:59:54,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:54,976 INFO ]: With dead ends: 688 [2018-06-24 20:59:54,976 INFO ]: Without dead ends: 530 [2018-06-24 20:59:54,978 INFO ]: 0 DeclaredPredicates, 175 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2995 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=891, Invalid=9009, Unknown=0, NotChecked=0, Total=9900 [2018-06-24 20:59:54,978 INFO ]: Start minimizeSevpa. Operand 530 states. [2018-06-24 20:59:55,025 INFO ]: Finished minimizeSevpa. Reduced states from 530 to 421. [2018-06-24 20:59:55,025 INFO ]: Start removeUnreachable. Operand 421 states. [2018-06-24 20:59:55,029 INFO ]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1246 transitions. [2018-06-24 20:59:55,029 INFO ]: Start accepts. Automaton has 421 states and 1246 transitions. Word has length 51 [2018-06-24 20:59:55,029 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:55,029 INFO ]: Abstraction has 421 states and 1246 transitions. [2018-06-24 20:59:55,029 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:59:55,029 INFO ]: Start isEmpty. Operand 421 states and 1246 transitions. [2018-06-24 20:59:55,036 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-24 20:59:55,036 INFO ]: Found error trace [2018-06-24 20:59:55,036 INFO ]: trace histogram [10, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:55,036 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:55,036 INFO ]: Analyzing trace with hash 826158889, now seen corresponding path program 1 times [2018-06-24 20:59:55,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:55,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:55,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:55,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:55,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:55,062 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:55,949 INFO ]: Checked inductivity of 173 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-06-24 20:59:55,950 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:55,950 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:55,959 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:56,034 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:56,037 INFO ]: Computing forward predicates... [2018-06-24 20:59:56,112 INFO ]: Checked inductivity of 173 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-24 20:59:56,142 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:56,142 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2018-06-24 20:59:56,143 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:59:56,143 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:59:56,143 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:59:56,143 INFO ]: Start difference. First operand 421 states and 1246 transitions. Second operand 21 states. [2018-06-24 21:00:00,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:00,112 INFO ]: Finished difference Result 1082 states and 4005 transitions. [2018-06-24 21:00:00,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-06-24 21:00:00,113 INFO ]: Start accepts. Automaton has 21 states. Word has length 58 [2018-06-24 21:00:00,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:00,126 INFO ]: With dead ends: 1082 [2018-06-24 21:00:00,126 INFO ]: Without dead ends: 876 [2018-06-24 21:00:00,128 INFO ]: 0 DeclaredPredicates, 219 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4890 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1512, Invalid=13250, Unknown=0, NotChecked=0, Total=14762 [2018-06-24 21:00:00,129 INFO ]: Start minimizeSevpa. Operand 876 states. [2018-06-24 21:00:00,224 INFO ]: Finished minimizeSevpa. Reduced states from 876 to 675. [2018-06-24 21:00:00,224 INFO ]: Start removeUnreachable. Operand 675 states. [2018-06-24 21:00:00,232 INFO ]: Finished removeUnreachable. Reduced from 675 states to 675 states and 2319 transitions. [2018-06-24 21:00:00,232 INFO ]: Start accepts. Automaton has 675 states and 2319 transitions. Word has length 58 [2018-06-24 21:00:00,233 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:00,233 INFO ]: Abstraction has 675 states and 2319 transitions. [2018-06-24 21:00:00,233 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:00:00,233 INFO ]: Start isEmpty. Operand 675 states and 2319 transitions. [2018-06-24 21:00:00,242 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-24 21:00:00,242 INFO ]: Found error trace [2018-06-24 21:00:00,242 INFO ]: trace histogram [10, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:00,242 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:00,242 INFO ]: Analyzing trace with hash 1307257368, now seen corresponding path program 1 times [2018-06-24 21:00:00,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:00,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:00,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:00,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:00,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:00,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:00,640 INFO ]: Checked inductivity of 171 backedges. 67 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-24 21:00:00,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:00,640 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:00:00,647 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:00,720 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:00,723 INFO ]: Computing forward predicates... [2018-06-24 21:00:00,757 INFO ]: Checked inductivity of 171 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-24 21:00:00,777 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:00,777 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2018-06-24 21:00:00,777 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:00:00,777 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:00:00,778 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:00,778 INFO ]: Start difference. First operand 675 states and 2319 transitions. Second operand 17 states. [2018-06-24 21:00:02,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:02,933 INFO ]: Finished difference Result 978 states and 3466 transitions. [2018-06-24 21:00:02,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-06-24 21:00:02,934 INFO ]: Start accepts. Automaton has 17 states. Word has length 58 [2018-06-24 21:00:02,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:02,947 INFO ]: With dead ends: 978 [2018-06-24 21:00:02,947 INFO ]: Without dead ends: 977 [2018-06-24 21:00:02,948 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=698, Invalid=5002, Unknown=0, NotChecked=0, Total=5700 [2018-06-24 21:00:02,948 INFO ]: Start minimizeSevpa. Operand 977 states. [2018-06-24 21:00:03,040 INFO ]: Finished minimizeSevpa. Reduced states from 977 to 780. [2018-06-24 21:00:03,040 INFO ]: Start removeUnreachable. Operand 780 states. [2018-06-24 21:00:03,052 INFO ]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2771 transitions. [2018-06-24 21:00:03,052 INFO ]: Start accepts. Automaton has 780 states and 2771 transitions. Word has length 58 [2018-06-24 21:00:03,052 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:03,052 INFO ]: Abstraction has 780 states and 2771 transitions. [2018-06-24 21:00:03,052 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:00:03,052 INFO ]: Start isEmpty. Operand 780 states and 2771 transitions. [2018-06-24 21:00:03,063 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-24 21:00:03,063 INFO ]: Found error trace [2018-06-24 21:00:03,063 INFO ]: trace histogram [10, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:03,063 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:03,063 INFO ]: Analyzing trace with hash 121860209, now seen corresponding path program 1 times [2018-06-24 21:00:03,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:03,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:03,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:03,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:03,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:03,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:03,886 INFO ]: Checked inductivity of 196 backedges. 57 proven. 38 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-24 21:00:03,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:03,886 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:00:03,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:03,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:03,979 INFO ]: Computing forward predicates... [2018-06-24 21:00:04,061 INFO ]: Checked inductivity of 196 backedges. 103 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-24 21:00:04,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:04,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-24 21:00:04,082 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:00:04,082 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:00:04,082 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:00:04,087 INFO ]: Start difference. First operand 780 states and 2771 transitions. Second operand 16 states. [2018-06-24 21:00:05,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:05,438 INFO ]: Finished difference Result 1055 states and 4301 transitions. [2018-06-24 21:00:05,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:00:05,439 INFO ]: Start accepts. Automaton has 16 states. Word has length 60 [2018-06-24 21:00:05,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:05,458 INFO ]: With dead ends: 1055 [2018-06-24 21:00:05,458 INFO ]: Without dead ends: 1050 [2018-06-24 21:00:05,459 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:00:05,459 INFO ]: Start minimizeSevpa. Operand 1050 states. [2018-06-24 21:00:05,570 INFO ]: Finished minimizeSevpa. Reduced states from 1050 to 879. [2018-06-24 21:00:05,570 INFO ]: Start removeUnreachable. Operand 879 states. [2018-06-24 21:00:05,582 INFO ]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3320 transitions. [2018-06-24 21:00:05,583 INFO ]: Start accepts. Automaton has 879 states and 3320 transitions. Word has length 60 [2018-06-24 21:00:05,583 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:05,583 INFO ]: Abstraction has 879 states and 3320 transitions. [2018-06-24 21:00:05,583 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:00:05,584 INFO ]: Start isEmpty. Operand 879 states and 3320 transitions. [2018-06-24 21:00:05,597 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:00:05,597 INFO ]: Found error trace [2018-06-24 21:00:05,598 INFO ]: trace histogram [11, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:05,598 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:05,598 INFO ]: Analyzing trace with hash 38318830, now seen corresponding path program 1 times [2018-06-24 21:00:05,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:05,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:05,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:05,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:05,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:05,634 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:05,879 INFO ]: Checked inductivity of 283 backedges. 42 proven. 43 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-06-24 21:00:05,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:05,879 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:05,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:05,986 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:05,989 INFO ]: Computing forward predicates... [2018-06-24 21:00:06,291 INFO ]: Checked inductivity of 283 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-24 21:00:06,311 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:00:06,311 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-06-24 21:00:06,312 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:00:06,312 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:00:06,312 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:00:06,312 INFO ]: Start difference. First operand 879 states and 3320 transitions. Second operand 11 states. [2018-06-24 21:00:06,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:06,619 INFO ]: Finished difference Result 943 states and 3640 transitions. [2018-06-24 21:00:06,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:00:06,619 INFO ]: Start accepts. Automaton has 11 states. Word has length 69 [2018-06-24 21:00:06,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:06,637 INFO ]: With dead ends: 943 [2018-06-24 21:00:06,637 INFO ]: Without dead ends: 930 [2018-06-24 21:00:06,638 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:06,638 INFO ]: Start minimizeSevpa. Operand 930 states. [2018-06-24 21:00:06,730 INFO ]: Finished minimizeSevpa. Reduced states from 930 to 879. [2018-06-24 21:00:06,730 INFO ]: Start removeUnreachable. Operand 879 states. [2018-06-24 21:00:06,743 INFO ]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3293 transitions. [2018-06-24 21:00:06,743 INFO ]: Start accepts. Automaton has 879 states and 3293 transitions. Word has length 69 [2018-06-24 21:00:06,815 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:06,815 INFO ]: Abstraction has 879 states and 3293 transitions. [2018-06-24 21:00:06,815 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:00:06,815 INFO ]: Start isEmpty. Operand 879 states and 3293 transitions. [2018-06-24 21:00:06,831 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:00:06,831 INFO ]: Found error trace [2018-06-24 21:00:06,831 INFO ]: trace histogram [11, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:06,831 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:06,831 INFO ]: Analyzing trace with hash 1521223532, now seen corresponding path program 2 times [2018-06-24 21:00:06,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:06,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:06,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:06,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:06,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:06,864 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:07,029 INFO ]: Checked inductivity of 283 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-06-24 21:00:07,029 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:07,029 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:00:07,035 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:07,150 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:07,150 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:07,155 INFO ]: Computing forward predicates... [2018-06-24 21:00:07,276 INFO ]: Checked inductivity of 283 backedges. 159 proven. 18 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-24 21:00:07,295 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:07,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-06-24 21:00:07,296 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:00:07,296 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:00:07,296 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:07,296 INFO ]: Start difference. First operand 879 states and 3293 transitions. Second operand 17 states. [2018-06-24 21:00:08,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:08,587 INFO ]: Finished difference Result 2045 states and 9511 transitions. [2018-06-24 21:00:08,588 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:00:08,588 INFO ]: Start accepts. Automaton has 17 states. Word has length 69 [2018-06-24 21:00:08,588 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:08,633 INFO ]: With dead ends: 2045 [2018-06-24 21:00:08,633 INFO ]: Without dead ends: 1813 [2018-06-24 21:00:08,633 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 21:00:08,634 INFO ]: Start minimizeSevpa. Operand 1813 states. [2018-06-24 21:00:08,825 INFO ]: Finished minimizeSevpa. Reduced states from 1813 to 1413. [2018-06-24 21:00:08,825 INFO ]: Start removeUnreachable. Operand 1413 states. [2018-06-24 21:00:08,847 INFO ]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 5243 transitions. [2018-06-24 21:00:08,847 INFO ]: Start accepts. Automaton has 1413 states and 5243 transitions. Word has length 69 [2018-06-24 21:00:08,847 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:08,847 INFO ]: Abstraction has 1413 states and 5243 transitions. [2018-06-24 21:00:08,847 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:00:08,847 INFO ]: Start isEmpty. Operand 1413 states and 5243 transitions. [2018-06-24 21:00:08,865 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-24 21:00:08,865 INFO ]: Found error trace [2018-06-24 21:00:08,865 INFO ]: trace histogram [11, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:08,865 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:08,865 INFO ]: Analyzing trace with hash -1334959186, now seen corresponding path program 3 times [2018-06-24 21:00:08,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:08,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:08,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:08,866 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:08,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:08,898 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:09,488 INFO ]: Checked inductivity of 300 backedges. 50 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-06-24 21:00:09,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:09,488 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:00:09,494 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:09,557 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 21:00:09,557 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:09,561 INFO ]: Computing forward predicates... [2018-06-24 21:00:10,793 INFO ]: Checked inductivity of 300 backedges. 82 proven. 1 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-06-24 21:00:10,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:10,812 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-24 21:00:10,812 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:10,812 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:10,812 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:00:10,812 INFO ]: Start difference. First operand 1413 states and 5243 transitions. Second operand 15 states. Received shutdown request... [2018-06-24 21:00:11,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:00:11,241 WARN ]: Verification canceled [2018-06-24 21:00:11,243 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:00:11,244 WARN ]: Timeout [2018-06-24 21:00:11,244 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:00:11 BasicIcfg [2018-06-24 21:00:11,244 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:00:11,245 INFO ]: Toolchain (without parser) took 57623.08 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 724.6 MB). Free memory was 261.2 MB in the beginning and 522.3 MB in the end (delta: -261.1 MB). Peak memory consumption was 463.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,246 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:00:11,246 INFO ]: ChcToBoogie took 56.55 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,246 INFO ]: Boogie Preprocessor took 53.05 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,246 INFO ]: RCFGBuilder took 618.43 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 235.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,247 INFO ]: BlockEncodingV2 took 170.04 ms. Allocated memory is still 308.8 MB. Free memory was 235.1 MB in the beginning and 230.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,247 INFO ]: TraceAbstraction took 56716.94 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 724.6 MB). Free memory was 230.1 MB in the beginning and 522.3 MB in the end (delta: -292.2 MB). Peak memory consumption was 432.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:11,250 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 35 locations, 58 edges - StatisticsResult: Encoded RCFG 28 locations, 51 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.55 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.05 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 618.43 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 235.1 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 170.04 ms. Allocated memory is still 308.8 MB. Free memory was 235.1 MB in the beginning and 230.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56716.94 ms. Allocated memory was 308.8 MB in the beginning and 1.0 GB in the end (delta: 724.6 MB). Free memory was 230.1 MB in the beginning and 522.3 MB in the end (delta: -292.2 MB). Peak memory consumption was 432.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1413states) and interpolant automaton (currently 17 states, 15 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. TIMEOUT Result, 56.6s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 40.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1467 SDtfs, 2110 SDslu, 5082 SDs, 0 SdLazy, 37017 SolverSat, 5477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2011 GetRequests, 1085 SyntacticMatches, 6 SemanticMatches, 919 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23555 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1413occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 2674 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 182679 SizeOfPredicates, 153 NumberOfNonLiveVariables, 12788 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 4067/4580 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/006b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-00-11-261.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-00-11-261.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-00-11-261.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-00-11-261.csv Completed graceful shutdown