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/006-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:59:32,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:59:32,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:59:32,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:59:32,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:59:32,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:59:32,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:59:32,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:59:32,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:59:32,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:59:32,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:59:32,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:59:32,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:59:32,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:59:32,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:59:32,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:59:32,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:59:32,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:59:32,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:59:32,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:59:32,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:59:32,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:59:32,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:59:32,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:59:32,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:59:32,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:59:32,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:59:32,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:59:32,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:59:32,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:59:32,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:59:32,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:59:32,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:59:32,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:59:32,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:59:32,056 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:32,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:59:32,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:59:32,072 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:59:32,072 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:59:32,073 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:59:32,073 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:59:32,074 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:59:32,074 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:59:32,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:59:32,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:59:32,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:59:32,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:59:32,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:59:32,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:59:32,076 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:59:32,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:59:32,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:59:32,077 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:59:32,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:59:32,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:59:32,078 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:59:32,079 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:59:32,079 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:59:32,123 INFO ]: Repository-Root is: /tmp [2018-06-24 20:59:32,141 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:59:32,147 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:59:32,148 INFO ]: Initializing SmtParser... [2018-06-24 20:59:32,149 INFO ]: SmtParser initialized [2018-06-24 20:59:32,149 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 [2018-06-24 20:59:32,150 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:32,240 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 unknown [2018-06-24 20:59:32,494 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/006-horn.smt2 [2018-06-24 20:59:32,503 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:59:32,510 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:59:32,511 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:59:32,511 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:59:32,511 INFO ]: ChcToBoogie initialized [2018-06-24 20:59:32,514 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,583 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32 Unit [2018-06-24 20:59:32,583 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:59:32,584 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:59:32,584 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:59:32,584 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:59:32,605 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,605 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,612 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,612 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,617 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,625 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,627 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (1/1) ... [2018-06-24 20:59:32,629 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:59:32,629 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:59:32,629 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:59:32,629 INFO ]: RCFGBuilder initialized [2018-06-24 20:59:32,630 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (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:32,640 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:59:32,640 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:59:32,640 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:59:32,640 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:59:32,640 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:59:32,640 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:33,188 INFO ]: Using library mode [2018-06-24 20:59:33,188 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:33 BoogieIcfgContainer [2018-06-24 20:59:33,188 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:59:33,189 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:59:33,189 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:59:33,190 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:59:33,190 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:33" (1/1) ... [2018-06-24 20:59:33,212 INFO ]: Initial Icfg 35 locations, 58 edges [2018-06-24 20:59:33,215 INFO ]: Using Remove infeasible edges [2018-06-24 20:59:33,215 INFO ]: Using Maximize final states [2018-06-24 20:59:33,216 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:59:33,216 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:59:33,219 INFO ]: Using Remove sink states [2018-06-24 20:59:33,220 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:59:33,220 INFO ]: Using Use SBE [2018-06-24 20:59:33,229 INFO ]: SBE split 0 edges [2018-06-24 20:59:33,234 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:59:33,236 INFO ]: 0 new accepting states [2018-06-24 20:59:33,288 INFO ]: Removed 13 edges and 5 locations by large block encoding [2018-06-24 20:59:33,290 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:59:33,291 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:59:33,291 INFO ]: 0 new accepting states [2018-06-24 20:59:33,292 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:59:33,293 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:59:33,293 INFO ]: Encoded RCFG 28 locations, 51 edges [2018-06-24 20:59:33,293 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:59:33 BasicIcfg [2018-06-24 20:59:33,293 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:59:33,295 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:59:33,295 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:59:33,298 INFO ]: TraceAbstraction initialized [2018-06-24 20:59:33,298 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:59:32" (1/4) ... [2018-06-24 20:59:33,299 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f64b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:59:33, skipping insertion in model container [2018-06-24 20:59:33,299 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:59:32" (2/4) ... [2018-06-24 20:59:33,299 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f64b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:59:33, skipping insertion in model container [2018-06-24 20:59:33,299 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:59:33" (3/4) ... [2018-06-24 20:59:33,300 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f64b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:59:33, skipping insertion in model container [2018-06-24 20:59:33,300 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:59:33" (4/4) ... [2018-06-24 20:59:33,308 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:59:33,317 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:59:33,335 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:59:33,381 INFO ]: Using default assertion order modulation [2018-06-24 20:59:33,382 INFO ]: Interprodecural is true [2018-06-24 20:59:33,382 INFO ]: Hoare is false [2018-06-24 20:59:33,382 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:59:33,382 INFO ]: Backedges is TWOTRACK [2018-06-24 20:59:33,382 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:59:33,382 INFO ]: Difference is false [2018-06-24 20:59:33,382 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:59:33,382 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:59:33,397 INFO ]: Start isEmpty. Operand 28 states. [2018-06-24 20:59:33,411 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:59:33,411 INFO ]: Found error trace [2018-06-24 20:59:33,412 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:59:33,412 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:33,417 INFO ]: Analyzing trace with hash 36020863, now seen corresponding path program 1 times [2018-06-24 20:59:33,419 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:33,419 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:33,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:33,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:33,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:33,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:33,554 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:33,556 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:59:33,556 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:59:33,558 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:33,568 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:33,569 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:33,571 INFO ]: Start difference. First operand 28 states. Second operand 3 states. [2018-06-24 20:59:33,954 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:33,955 INFO ]: Finished difference Result 41 states and 76 transitions. [2018-06-24 20:59:33,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:33,956 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:59:33,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:33,967 INFO ]: With dead ends: 41 [2018-06-24 20:59:33,967 INFO ]: Without dead ends: 41 [2018-06-24 20:59:33,968 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:33,981 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:59:34,010 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:59:34,011 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:59:34,015 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 76 transitions. [2018-06-24 20:59:34,016 INFO ]: Start accepts. Automaton has 41 states and 76 transitions. Word has length 5 [2018-06-24 20:59:34,017 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:34,017 INFO ]: Abstraction has 41 states and 76 transitions. [2018-06-24 20:59:34,017 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:34,017 INFO ]: Start isEmpty. Operand 41 states and 76 transitions. [2018-06-24 20:59:34,023 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:59:34,023 INFO ]: Found error trace [2018-06-24 20:59:34,023 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:59:34,023 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:34,023 INFO ]: Analyzing trace with hash 1118685385, now seen corresponding path program 1 times [2018-06-24 20:59:34,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:34,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:34,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:34,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:34,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:34,038 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:34,072 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:34,072 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:59:34,072 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:59:34,073 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:34,074 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:34,074 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:34,074 INFO ]: Start difference. First operand 41 states and 76 transitions. Second operand 3 states. [2018-06-24 20:59:34,293 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:34,294 INFO ]: Finished difference Result 54 states and 102 transitions. [2018-06-24 20:59:34,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:34,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:59:34,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:34,298 INFO ]: With dead ends: 54 [2018-06-24 20:59:34,298 INFO ]: Without dead ends: 54 [2018-06-24 20:59:34,299 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:34,299 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:59:34,326 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-24 20:59:34,326 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-24 20:59:34,328 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 102 transitions. [2018-06-24 20:59:34,328 INFO ]: Start accepts. Automaton has 54 states and 102 transitions. Word has length 6 [2018-06-24 20:59:34,328 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:34,328 INFO ]: Abstraction has 54 states and 102 transitions. [2018-06-24 20:59:34,328 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:34,329 INFO ]: Start isEmpty. Operand 54 states and 102 transitions. [2018-06-24 20:59:34,334 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:59:34,334 INFO ]: Found error trace [2018-06-24 20:59:34,334 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:34,334 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:34,335 INFO ]: Analyzing trace with hash -979799857, now seen corresponding path program 1 times [2018-06-24 20:59:34,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:34,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:34,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:34,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:34,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:34,357 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:34,403 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:34,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:34,403 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:34,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:34,455 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:34,463 INFO ]: Computing forward predicates... [2018-06-24 20:59:34,492 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:34,530 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:34,530 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-24 20:59:34,530 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:59:34,530 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:59:34,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:59:34,531 INFO ]: Start difference. First operand 54 states and 102 transitions. Second operand 3 states. [2018-06-24 20:59:35,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:35,058 INFO ]: Finished difference Result 67 states and 124 transitions. [2018-06-24 20:59:35,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:59:35,058 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-24 20:59:35,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:35,061 INFO ]: With dead ends: 67 [2018-06-24 20:59:35,061 INFO ]: Without dead ends: 67 [2018-06-24 20:59:35,062 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 16 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:35,062 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:59:35,072 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-24 20:59:35,072 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 20:59:35,076 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 124 transitions. [2018-06-24 20:59:35,076 INFO ]: Start accepts. Automaton has 67 states and 124 transitions. Word has length 15 [2018-06-24 20:59:35,076 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:35,076 INFO ]: Abstraction has 67 states and 124 transitions. [2018-06-24 20:59:35,076 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:59:35,076 INFO ]: Start isEmpty. Operand 67 states and 124 transitions. [2018-06-24 20:59:35,079 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:59:35,079 INFO ]: Found error trace [2018-06-24 20:59:35,079 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:35,079 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:35,079 INFO ]: Analyzing trace with hash 1102024481, now seen corresponding path program 1 times [2018-06-24 20:59:35,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:35,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:35,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:35,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:35,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:35,130 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:35,563 WARN ]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-24 20:59:35,642 INFO ]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 20:59:35,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:35,642 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:35,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:35,696 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:35,700 INFO ]: Computing forward predicates... [2018-06-24 20:59:35,801 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:35,819 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:35,820 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:59:35,820 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:59:35,820 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:59:35,820 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:59:35,820 INFO ]: Start difference. First operand 67 states and 124 transitions. Second operand 9 states. [2018-06-24 20:59:36,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:36,787 INFO ]: Finished difference Result 119 states and 294 transitions. [2018-06-24 20:59:36,788 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:59:36,788 INFO ]: Start accepts. Automaton has 9 states. Word has length 22 [2018-06-24 20:59:36,788 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:36,795 INFO ]: With dead ends: 119 [2018-06-24 20:59:36,795 INFO ]: Without dead ends: 97 [2018-06-24 20:59:36,795 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:59:36,796 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 20:59:36,821 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 75. [2018-06-24 20:59:36,821 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 20:59:36,823 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 155 transitions. [2018-06-24 20:59:36,823 INFO ]: Start accepts. Automaton has 75 states and 155 transitions. Word has length 22 [2018-06-24 20:59:36,823 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:36,823 INFO ]: Abstraction has 75 states and 155 transitions. [2018-06-24 20:59:36,823 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:59:36,823 INFO ]: Start isEmpty. Operand 75 states and 155 transitions. [2018-06-24 20:59:36,826 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:36,826 INFO ]: Found error trace [2018-06-24 20:59:36,826 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:36,827 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:36,827 INFO ]: Analyzing trace with hash 2119563394, now seen corresponding path program 1 times [2018-06-24 20:59:36,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:36,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:36,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:36,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:36,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:36,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:37,147 INFO ]: Checked inductivity of 33 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-24 20:59:37,147 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:37,147 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:37,155 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:37,209 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:37,214 INFO ]: Computing forward predicates... [2018-06-24 20:59:37,598 INFO ]: Checked inductivity of 33 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:59:37,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:37,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-06-24 20:59:37,635 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:59:37,635 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:59:37,636 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:59:37,636 INFO ]: Start difference. First operand 75 states and 155 transitions. Second operand 20 states. [2018-06-24 20:59:39,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:39,384 INFO ]: Finished difference Result 103 states and 258 transitions. [2018-06-24 20:59:39,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:59:39,384 INFO ]: Start accepts. Automaton has 20 states. Word has length 28 [2018-06-24 20:59:39,384 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:39,388 INFO ]: With dead ends: 103 [2018-06-24 20:59:39,388 INFO ]: Without dead ends: 103 [2018-06-24 20:59:39,389 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:59:39,389 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 20:59:39,410 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 79. [2018-06-24 20:59:39,410 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 20:59:39,412 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 177 transitions. [2018-06-24 20:59:39,412 INFO ]: Start accepts. Automaton has 79 states and 177 transitions. Word has length 28 [2018-06-24 20:59:39,412 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:39,412 INFO ]: Abstraction has 79 states and 177 transitions. [2018-06-24 20:59:39,412 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:59:39,412 INFO ]: Start isEmpty. Operand 79 states and 177 transitions. [2018-06-24 20:59:39,415 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:39,415 INFO ]: Found error trace [2018-06-24 20:59:39,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:39,415 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:39,415 INFO ]: Analyzing trace with hash -1896366746, now seen corresponding path program 1 times [2018-06-24 20:59:39,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:39,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:39,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:39,416 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:39,436 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:39,492 INFO ]: Checked inductivity of 33 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:59:39,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:39,492 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:39,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:39,542 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:39,545 INFO ]: Computing forward predicates... [2018-06-24 20:59:39,720 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:39,739 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:39,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-06-24 20:59:39,739 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:39,740 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:39,740 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:39,740 INFO ]: Start difference. First operand 79 states and 177 transitions. Second operand 13 states. [2018-06-24 20:59:40,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:40,581 INFO ]: Finished difference Result 142 states and 428 transitions. [2018-06-24 20:59:40,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:59:40,585 INFO ]: Start accepts. Automaton has 13 states. Word has length 28 [2018-06-24 20:59:40,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:40,589 INFO ]: With dead ends: 142 [2018-06-24 20:59:40,590 INFO ]: Without dead ends: 137 [2018-06-24 20:59:40,590 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:59:40,590 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-24 20:59:40,618 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 83. [2018-06-24 20:59:40,618 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-24 20:59:40,620 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 185 transitions. [2018-06-24 20:59:40,620 INFO ]: Start accepts. Automaton has 83 states and 185 transitions. Word has length 28 [2018-06-24 20:59:40,620 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:40,620 INFO ]: Abstraction has 83 states and 185 transitions. [2018-06-24 20:59:40,620 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:40,620 INFO ]: Start isEmpty. Operand 83 states and 185 transitions. [2018-06-24 20:59:40,622 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:59:40,622 INFO ]: Found error trace [2018-06-24 20:59:40,622 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:40,623 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:40,623 INFO ]: Analyzing trace with hash 78947080, now seen corresponding path program 1 times [2018-06-24 20:59:40,623 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:40,623 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:40,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:40,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:40,624 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:40,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:40,793 INFO ]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:59:40,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:40,793 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:40,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:40,844 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:40,848 INFO ]: Computing forward predicates... [2018-06-24 20:59:40,927 INFO ]: Checked inductivity of 33 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 20:59:40,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:40,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-24 20:59:40,958 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:59:40,958 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:59:40,958 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:59:40,958 INFO ]: Start difference. First operand 83 states and 185 transitions. Second operand 14 states. [2018-06-24 20:59:41,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:41,755 INFO ]: Finished difference Result 130 states and 406 transitions. [2018-06-24 20:59:41,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:59:41,755 INFO ]: Start accepts. Automaton has 14 states. Word has length 28 [2018-06-24 20:59:41,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:41,759 INFO ]: With dead ends: 130 [2018-06-24 20:59:41,759 INFO ]: Without dead ends: 130 [2018-06-24 20:59:41,759 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:59:41,760 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-24 20:59:41,783 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 99. [2018-06-24 20:59:41,783 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-24 20:59:41,785 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 254 transitions. [2018-06-24 20:59:41,785 INFO ]: Start accepts. Automaton has 99 states and 254 transitions. Word has length 28 [2018-06-24 20:59:41,786 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:41,786 INFO ]: Abstraction has 99 states and 254 transitions. [2018-06-24 20:59:41,786 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:59:41,786 INFO ]: Start isEmpty. Operand 99 states and 254 transitions. [2018-06-24 20:59:41,789 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:41,789 INFO ]: Found error trace [2018-06-24 20:59:41,789 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:41,789 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:41,789 INFO ]: Analyzing trace with hash -988552897, now seen corresponding path program 1 times [2018-06-24 20:59:41,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:41,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:41,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:41,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:41,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:41,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:41,884 INFO ]: Checked inductivity of 49 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 20:59:41,885 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:41,885 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:41,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:41,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:41,936 INFO ]: Computing forward predicates... [2018-06-24 20:59:42,037 INFO ]: Checked inductivity of 49 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 20:59:42,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:42,056 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:59:42,056 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:59:42,056 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:59:42,056 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:59:42,057 INFO ]: Start difference. First operand 99 states and 254 transitions. Second operand 11 states. [2018-06-24 20:59:43,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:43,425 INFO ]: Finished difference Result 154 states and 465 transitions. [2018-06-24 20:59:43,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:59:43,425 INFO ]: Start accepts. Automaton has 11 states. Word has length 33 [2018-06-24 20:59:43,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:43,429 INFO ]: With dead ends: 154 [2018-06-24 20:59:43,429 INFO ]: Without dead ends: 148 [2018-06-24 20:59:43,429 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:59:43,429 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 20:59:43,473 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 113. [2018-06-24 20:59:43,473 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 20:59:43,475 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 298 transitions. [2018-06-24 20:59:43,476 INFO ]: Start accepts. Automaton has 113 states and 298 transitions. Word has length 33 [2018-06-24 20:59:43,476 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:43,476 INFO ]: Abstraction has 113 states and 298 transitions. [2018-06-24 20:59:43,476 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:59:43,476 INFO ]: Start isEmpty. Operand 113 states and 298 transitions. [2018-06-24 20:59:43,479 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:59:43,479 INFO ]: Found error trace [2018-06-24 20:59:43,479 INFO ]: trace histogram [6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:59:43,480 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:43,480 INFO ]: Analyzing trace with hash -289986367, now seen corresponding path program 2 times [2018-06-24 20:59:43,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:43,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:43,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:43,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:43,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:43,518 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:43,699 INFO ]: Checked inductivity of 53 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 20:59:43,699 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:43,699 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:43,706 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:59:43,748 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:59:43,748 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:43,752 INFO ]: Computing forward predicates... [2018-06-24 20:59:43,816 INFO ]: Checked inductivity of 53 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-24 20:59:43,835 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:43,835 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 20:59:43,836 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:59:43,836 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:59:43,836 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:59:43,836 INFO ]: Start difference. First operand 113 states and 298 transitions. Second operand 16 states. [2018-06-24 20:59:45,408 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:45,409 INFO ]: Finished difference Result 154 states and 476 transitions. [2018-06-24 20:59:45,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:59:45,409 INFO ]: Start accepts. Automaton has 16 states. Word has length 34 [2018-06-24 20:59:45,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:45,412 INFO ]: With dead ends: 154 [2018-06-24 20:59:45,412 INFO ]: Without dead ends: 151 [2018-06-24 20:59:45,413 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:59:45,413 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-24 20:59:45,448 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-06-24 20:59:45,448 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-24 20:59:45,450 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 343 transitions. [2018-06-24 20:59:45,450 INFO ]: Start accepts. Automaton has 121 states and 343 transitions. Word has length 34 [2018-06-24 20:59:45,450 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:45,450 INFO ]: Abstraction has 121 states and 343 transitions. [2018-06-24 20:59:45,450 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:59:45,450 INFO ]: Start isEmpty. Operand 121 states and 343 transitions. [2018-06-24 20:59:45,455 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:45,455 INFO ]: Found error trace [2018-06-24 20:59:45,455 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:45,455 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:45,455 INFO ]: Analyzing trace with hash 1693512657, now seen corresponding path program 1 times [2018-06-24 20:59:45,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:45,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:45,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:45,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:45,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:45,620 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:45,720 INFO ]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 20:59:45,720 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:45,720 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:45,728 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:45,765 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:45,768 INFO ]: Computing forward predicates... [2018-06-24 20:59:45,777 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:45,796 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:45,796 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2018-06-24 20:59:45,819 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:59:45,820 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:59:45,820 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:59:45,820 INFO ]: Start difference. First operand 121 states and 343 transitions. Second operand 7 states. [2018-06-24 20:59:46,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:46,021 INFO ]: Finished difference Result 128 states and 374 transitions. [2018-06-24 20:59:46,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:59:46,023 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-24 20:59:46,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:46,025 INFO ]: With dead ends: 128 [2018-06-24 20:59:46,025 INFO ]: Without dead ends: 128 [2018-06-24 20:59:46,026 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:59:46,026 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-24 20:59:46,044 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-06-24 20:59:46,044 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-24 20:59:46,045 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 298 transitions. [2018-06-24 20:59:46,045 INFO ]: Start accepts. Automaton has 110 states and 298 transitions. Word has length 33 [2018-06-24 20:59:46,046 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:46,046 INFO ]: Abstraction has 110 states and 298 transitions. [2018-06-24 20:59:46,046 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:59:46,046 INFO ]: Start isEmpty. Operand 110 states and 298 transitions. [2018-06-24 20:59:46,049 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:59:46,049 INFO ]: Found error trace [2018-06-24 20:59:46,049 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:46,049 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:46,049 INFO ]: Analyzing trace with hash 588425717, now seen corresponding path program 1 times [2018-06-24 20:59:46,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:46,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:46,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:46,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:46,199 INFO ]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-24 20:59:46,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:46,199 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:46,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:46,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:46,243 INFO ]: Computing forward predicates... [2018-06-24 20:59:46,264 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:46,283 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:59:46,283 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2018-06-24 20:59:46,284 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:59:46,284 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:59:46,284 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:59:46,284 INFO ]: Start difference. First operand 110 states and 298 transitions. Second operand 7 states. [2018-06-24 20:59:46,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:46,895 INFO ]: Finished difference Result 132 states and 405 transitions. [2018-06-24 20:59:46,895 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:59:46,896 INFO ]: Start accepts. Automaton has 7 states. Word has length 33 [2018-06-24 20:59:46,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:46,898 INFO ]: With dead ends: 132 [2018-06-24 20:59:46,898 INFO ]: Without dead ends: 132 [2018-06-24 20:59:46,898 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:59:46,899 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 20:59:46,912 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-06-24 20:59:46,912 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-24 20:59:46,914 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2018-06-24 20:59:46,914 INFO ]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 33 [2018-06-24 20:59:46,914 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:46,914 INFO ]: Abstraction has 102 states and 255 transitions. [2018-06-24 20:59:46,914 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:59:46,914 INFO ]: Start isEmpty. Operand 102 states and 255 transitions. [2018-06-24 20:59:46,916 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:59:46,916 INFO ]: Found error trace [2018-06-24 20:59:46,916 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:46,916 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:46,917 INFO ]: Analyzing trace with hash -1169876686, now seen corresponding path program 1 times [2018-06-24 20:59:46,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:46,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:46,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:46,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:46,934 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:47,028 INFO ]: Checked inductivity of 70 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 20:59:47,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:47,028 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:47,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:47,090 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:47,093 INFO ]: Computing forward predicates... [2018-06-24 20:59:47,115 INFO ]: Checked inductivity of 70 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:59:47,135 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:47,135 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:59:47,135 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:59:47,135 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:59:47,135 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:59:47,135 INFO ]: Start difference. First operand 102 states and 255 transitions. Second operand 9 states. [2018-06-24 20:59:47,379 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:47,379 INFO ]: Finished difference Result 114 states and 313 transitions. [2018-06-24 20:59:47,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:59:47,379 INFO ]: Start accepts. Automaton has 9 states. Word has length 39 [2018-06-24 20:59:47,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:47,381 INFO ]: With dead ends: 114 [2018-06-24 20:59:47,381 INFO ]: Without dead ends: 114 [2018-06-24 20:59:47,381 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:59:47,381 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-24 20:59:47,392 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-06-24 20:59:47,392 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-24 20:59:47,403 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 274 transitions. [2018-06-24 20:59:47,403 INFO ]: Start accepts. Automaton has 105 states and 274 transitions. Word has length 39 [2018-06-24 20:59:47,403 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:47,403 INFO ]: Abstraction has 105 states and 274 transitions. [2018-06-24 20:59:47,403 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:59:47,403 INFO ]: Start isEmpty. Operand 105 states and 274 transitions. [2018-06-24 20:59:47,408 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 20:59:47,408 INFO ]: Found error trace [2018-06-24 20:59:47,408 INFO ]: trace histogram [9, 5, 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] [2018-06-24 20:59:47,408 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:47,409 INFO ]: Analyzing trace with hash -1693817326, now seen corresponding path program 2 times [2018-06-24 20:59:47,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:47,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:47,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:47,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:47,409 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:47,439 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:48,475 INFO ]: Checked inductivity of 130 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 20:59:48,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:48,475 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:59:48,487 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:59:48,544 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:59:48,544 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:48,548 INFO ]: Computing forward predicates... [2018-06-24 20:59:48,658 INFO ]: Checked inductivity of 130 backedges. 74 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:59:48,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:48,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2018-06-24 20:59:48,678 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:59:48,678 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:59:48,678 INFO ]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:59:48,678 INFO ]: Start difference. First operand 105 states and 274 transitions. Second operand 21 states. [2018-06-24 20:59:49,936 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:49,937 INFO ]: Finished difference Result 152 states and 485 transitions. [2018-06-24 20:59:49,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:59:49,938 INFO ]: Start accepts. Automaton has 21 states. Word has length 51 [2018-06-24 20:59:49,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:49,940 INFO ]: With dead ends: 152 [2018-06-24 20:59:49,940 INFO ]: Without dead ends: 149 [2018-06-24 20:59:49,940 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:59:49,940 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-24 20:59:49,961 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 113. [2018-06-24 20:59:49,961 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-24 20:59:49,963 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 311 transitions. [2018-06-24 20:59:49,963 INFO ]: Start accepts. Automaton has 113 states and 311 transitions. Word has length 51 [2018-06-24 20:59:49,963 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:49,963 INFO ]: Abstraction has 113 states and 311 transitions. [2018-06-24 20:59:49,963 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:59:49,963 INFO ]: Start isEmpty. Operand 113 states and 311 transitions. [2018-06-24 20:59:49,967 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-24 20:59:49,967 INFO ]: Found error trace [2018-06-24 20:59:49,967 INFO ]: trace histogram [8, 4, 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 20:59:49,967 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:49,967 INFO ]: Analyzing trace with hash 1628898673, now seen corresponding path program 3 times [2018-06-24 20:59:49,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:49,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:49,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:49,968 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:49,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:49,987 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:50,232 INFO ]: Checked inductivity of 97 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-06-24 20:59:50,233 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:50,233 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:50,238 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:59:50,286 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:59:50,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:50,289 INFO ]: Computing forward predicates... [2018-06-24 20:59:50,470 INFO ]: Checked inductivity of 97 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 20:59:50,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:50,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-06-24 20:59:50,490 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:59:50,490 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:59:50,490 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:59:50,490 INFO ]: Start difference. First operand 113 states and 311 transitions. Second operand 14 states. [2018-06-24 20:59:51,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:51,325 INFO ]: Finished difference Result 134 states and 384 transitions. [2018-06-24 20:59:51,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:59:51,325 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-24 20:59:51,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:51,327 INFO ]: With dead ends: 134 [2018-06-24 20:59:51,327 INFO ]: Without dead ends: 134 [2018-06-24 20:59:51,328 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:59:51,328 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:59:51,341 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 114. [2018-06-24 20:59:51,341 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-24 20:59:51,342 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 302 transitions. [2018-06-24 20:59:51,343 INFO ]: Start accepts. Automaton has 114 states and 302 transitions. Word has length 45 [2018-06-24 20:59:51,343 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:51,343 INFO ]: Abstraction has 114 states and 302 transitions. [2018-06-24 20:59:51,343 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:59:51,343 INFO ]: Start isEmpty. Operand 114 states and 302 transitions. [2018-06-24 20:59:51,347 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:59:51,348 INFO ]: Found error trace [2018-06-24 20:59:51,348 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, 1] [2018-06-24 20:59:51,348 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:51,348 INFO ]: Analyzing trace with hash -285425370, now seen corresponding path program 1 times [2018-06-24 20:59:51,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:51,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:51,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:51,348 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:59:51,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:51,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:51,585 INFO ]: Checked inductivity of 77 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 20:59:51,585 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:51,585 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:51,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:51,645 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:51,647 INFO ]: Computing forward predicates... [2018-06-24 20:59:51,783 INFO ]: Checked inductivity of 77 backedges. 50 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 20:59:51,801 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:51,802 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-06-24 20:59:51,802 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:59:51,802 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:59:51,802 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:59:51,802 INFO ]: Start difference. First operand 114 states and 302 transitions. Second operand 17 states. [2018-06-24 20:59:52,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:52,977 INFO ]: Finished difference Result 160 states and 562 transitions. [2018-06-24 20:59:52,977 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:59:52,977 INFO ]: Start accepts. Automaton has 17 states. Word has length 40 [2018-06-24 20:59:52,977 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:52,980 INFO ]: With dead ends: 160 [2018-06-24 20:59:52,980 INFO ]: Without dead ends: 160 [2018-06-24 20:59:52,984 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:59:52,984 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-24 20:59:53,003 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 122. [2018-06-24 20:59:53,003 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-24 20:59:53,005 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 361 transitions. [2018-06-24 20:59:53,005 INFO ]: Start accepts. Automaton has 122 states and 361 transitions. Word has length 40 [2018-06-24 20:59:53,005 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:53,005 INFO ]: Abstraction has 122 states and 361 transitions. [2018-06-24 20:59:53,005 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:59:53,005 INFO ]: Start isEmpty. Operand 122 states and 361 transitions. [2018-06-24 20:59:53,010 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:59:53,010 INFO ]: Found error trace [2018-06-24 20:59:53,010 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:53,010 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:53,010 INFO ]: Analyzing trace with hash 1082478300, now seen corresponding path program 1 times [2018-06-24 20:59:53,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:53,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:53,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:53,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:53,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:53,028 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:53,307 INFO ]: Checked inductivity of 70 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-24 20:59:53,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:53,307 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:53,324 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:53,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:53,396 INFO ]: Computing forward predicates... [2018-06-24 20:59:53,634 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:53,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:53,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-06-24 20:59:53,653 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:59:53,653 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:59:53,653 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:59:53,653 INFO ]: Start difference. First operand 122 states and 361 transitions. Second operand 14 states. [2018-06-24 20:59:54,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:54,242 INFO ]: Finished difference Result 147 states and 473 transitions. [2018-06-24 20:59:54,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:59:54,242 INFO ]: Start accepts. Automaton has 14 states. Word has length 39 [2018-06-24 20:59:54,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:54,243 INFO ]: With dead ends: 147 [2018-06-24 20:59:54,243 INFO ]: Without dead ends: 147 [2018-06-24 20:59:54,244 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:59:54,244 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-24 20:59:54,259 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 122. [2018-06-24 20:59:54,259 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-24 20:59:54,261 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 359 transitions. [2018-06-24 20:59:54,261 INFO ]: Start accepts. Automaton has 122 states and 359 transitions. Word has length 39 [2018-06-24 20:59:54,261 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:54,261 INFO ]: Abstraction has 122 states and 359 transitions. [2018-06-24 20:59:54,261 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:59:54,261 INFO ]: Start isEmpty. Operand 122 states and 359 transitions. [2018-06-24 20:59:54,264 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:59:54,265 INFO ]: Found error trace [2018-06-24 20:59:54,265 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:54,265 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:54,265 INFO ]: Analyzing trace with hash 1866557670, now seen corresponding path program 1 times [2018-06-24 20:59:54,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:54,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:54,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:54,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:54,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:54,281 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:54,924 INFO ]: Checked inductivity of 70 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 20:59:54,924 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:54,924 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:54,930 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:54,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:54,977 INFO ]: Computing forward predicates... [2018-06-24 20:59:55,013 INFO ]: Checked inductivity of 70 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 20:59:55,035 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:55,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:59:55,035 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:59:55,035 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:59:55,035 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:59:55,036 INFO ]: Start difference. First operand 122 states and 359 transitions. Second operand 13 states. [2018-06-24 20:59:55,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:59:55,505 INFO ]: Finished difference Result 145 states and 453 transitions. [2018-06-24 20:59:55,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:59:55,505 INFO ]: Start accepts. Automaton has 13 states. Word has length 39 [2018-06-24 20:59:55,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:59:55,507 INFO ]: With dead ends: 145 [2018-06-24 20:59:55,507 INFO ]: Without dead ends: 139 [2018-06-24 20:59:55,507 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:59:55,508 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-24 20:59:55,539 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-06-24 20:59:55,539 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-24 20:59:55,540 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2018-06-24 20:59:55,540 INFO ]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 39 [2018-06-24 20:59:55,541 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:59:55,541 INFO ]: Abstraction has 111 states and 285 transitions. [2018-06-24 20:59:55,541 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:59:55,541 INFO ]: Start isEmpty. Operand 111 states and 285 transitions. [2018-06-24 20:59:55,545 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 20:59:55,545 INFO ]: Found error trace [2018-06-24 20:59:55,545 INFO ]: trace histogram [8, 4, 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, 1, 1, 1, 1] [2018-06-24 20:59:55,545 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:59:55,545 INFO ]: Analyzing trace with hash -882145017, now seen corresponding path program 1 times [2018-06-24 20:59:55,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:59:55,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:59:55,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:55,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:55,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:59:55,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:55,946 INFO ]: Checked inductivity of 103 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 20:59:55,946 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:59:55,946 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:55,952 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:59:56,006 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:59:56,011 INFO ]: Computing forward predicates... [2018-06-24 20:59:56,653 INFO ]: Checked inductivity of 103 backedges. 40 proven. 39 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-24 20:59:56,672 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:59:56,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-24 20:59:56,672 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:59:56,672 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:59:56,672 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:59:56,672 INFO ]: Start difference. First operand 111 states and 285 transitions. Second operand 34 states. [2018-06-24 20:59:59,190 WARN ]: Spent 355.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-06-24 21:00:00,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:00,436 INFO ]: Finished difference Result 147 states and 457 transitions. [2018-06-24 21:00:00,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:00:00,436 INFO ]: Start accepts. Automaton has 34 states. Word has length 46 [2018-06-24 21:00:00,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:00,437 INFO ]: With dead ends: 147 [2018-06-24 21:00:00,437 INFO ]: Without dead ends: 147 [2018-06-24 21:00:00,438 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=333, Invalid=2859, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:00:00,438 INFO ]: Start minimizeSevpa. Operand 147 states. [2018-06-24 21:00:00,449 INFO ]: Finished minimizeSevpa. Reduced states from 147 to 119. [2018-06-24 21:00:00,449 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-24 21:00:00,451 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 324 transitions. [2018-06-24 21:00:00,451 INFO ]: Start accepts. Automaton has 119 states and 324 transitions. Word has length 46 [2018-06-24 21:00:00,451 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:00,451 INFO ]: Abstraction has 119 states and 324 transitions. [2018-06-24 21:00:00,451 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:00:00,451 INFO ]: Start isEmpty. Operand 119 states and 324 transitions. [2018-06-24 21:00:00,454 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-24 21:00:00,454 INFO ]: Found error trace [2018-06-24 21:00:00,454 INFO ]: trace histogram [10, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:00,454 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:00,454 INFO ]: Analyzing trace with hash 989191607, now seen corresponding path program 1 times [2018-06-24 21:00:00,454 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:00,454 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:00,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:00,455 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:00,455 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:00,482 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:00,969 INFO ]: Checked inductivity of 163 backedges. 60 proven. 39 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-24 21:00:00,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:00,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:00,975 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:01,039 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:01,043 INFO ]: Computing forward predicates... [2018-06-24 21:00:01,117 INFO ]: Checked inductivity of 163 backedges. 99 proven. 16 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-24 21:00:01,138 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:01,138 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-24 21:00:01,139 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:00:01,139 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:00:01,139 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:00:01,139 INFO ]: Start difference. First operand 119 states and 324 transitions. Second operand 16 states. [2018-06-24 21:00:01,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:01,742 INFO ]: Finished difference Result 148 states and 457 transitions. [2018-06-24 21:00:01,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 21:00:01,765 INFO ]: Start accepts. Automaton has 16 states. Word has length 57 [2018-06-24 21:00:01,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:01,766 INFO ]: With dead ends: 148 [2018-06-24 21:00:01,766 INFO ]: Without dead ends: 148 [2018-06-24 21:00:01,766 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:00:01,767 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 21:00:01,783 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 131. [2018-06-24 21:00:01,783 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 21:00:01,785 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 374 transitions. [2018-06-24 21:00:01,785 INFO ]: Start accepts. Automaton has 131 states and 374 transitions. Word has length 57 [2018-06-24 21:00:01,785 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:01,785 INFO ]: Abstraction has 131 states and 374 transitions. [2018-06-24 21:00:01,785 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:00:01,785 INFO ]: Start isEmpty. Operand 131 states and 374 transitions. [2018-06-24 21:00:01,788 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:00:01,788 INFO ]: Found error trace [2018-06-24 21:00:01,788 INFO ]: trace histogram [8, 4, 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:01,788 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:01,788 INFO ]: Analyzing trace with hash 1400776989, now seen corresponding path program 1 times [2018-06-24 21:00:01,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:01,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:01,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:01,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:01,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:01,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:01,950 INFO ]: Checked inductivity of 105 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-06-24 21:00:01,950 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:01,950 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:01,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:02,032 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:02,035 INFO ]: Computing forward predicates... [2018-06-24 21:00:02,279 INFO ]: Checked inductivity of 105 backedges. 46 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-24 21:00:02,298 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:02,298 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-24 21:00:02,299 INFO ]: Interpolant automaton has 20 states [2018-06-24 21:00:02,299 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 21:00:02,299 INFO ]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:00:02,299 INFO ]: Start difference. First operand 131 states and 374 transitions. Second operand 20 states. [2018-06-24 21:00:03,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:03,222 INFO ]: Finished difference Result 179 states and 627 transitions. [2018-06-24 21:00:03,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:00:03,222 INFO ]: Start accepts. Automaton has 20 states. Word has length 46 [2018-06-24 21:00:03,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:03,224 INFO ]: With dead ends: 179 [2018-06-24 21:00:03,224 INFO ]: Without dead ends: 175 [2018-06-24 21:00:03,224 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:00:03,224 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-24 21:00:03,247 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 130. [2018-06-24 21:00:03,247 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-24 21:00:03,249 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 375 transitions. [2018-06-24 21:00:03,249 INFO ]: Start accepts. Automaton has 130 states and 375 transitions. Word has length 46 [2018-06-24 21:00:03,249 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:03,249 INFO ]: Abstraction has 130 states and 375 transitions. [2018-06-24 21:00:03,249 INFO ]: Interpolant automaton has 20 states. [2018-06-24 21:00:03,249 INFO ]: Start isEmpty. Operand 130 states and 375 transitions. [2018-06-24 21:00:03,252 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-24 21:00:03,252 INFO ]: Found error trace [2018-06-24 21:00:03,252 INFO ]: trace histogram [10, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:03,252 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:03,252 INFO ]: Analyzing trace with hash -744462373, now seen corresponding path program 1 times [2018-06-24 21:00:03,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:03,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:03,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:03,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:03,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:03,277 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:03,674 INFO ]: Checked inductivity of 163 backedges. 60 proven. 37 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:00:03,674 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:03,674 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,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:03,748 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:03,751 INFO ]: Computing forward predicates... [2018-06-24 21:00:03,804 INFO ]: Checked inductivity of 163 backedges. 99 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-24 21:00:03,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:03,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-24 21:00:03,824 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:03,825 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:03,825 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:00:03,825 INFO ]: Start difference. First operand 130 states and 375 transitions. Second operand 15 states. [2018-06-24 21:00:04,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:04,520 INFO ]: Finished difference Result 156 states and 490 transitions. [2018-06-24 21:00:04,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 21:00:04,520 INFO ]: Start accepts. Automaton has 15 states. Word has length 57 [2018-06-24 21:00:04,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:04,521 INFO ]: With dead ends: 156 [2018-06-24 21:00:04,521 INFO ]: Without dead ends: 156 [2018-06-24 21:00:04,522 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:00:04,522 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-24 21:00:04,535 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 132. [2018-06-24 21:00:04,535 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 21:00:04,537 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 380 transitions. [2018-06-24 21:00:04,537 INFO ]: Start accepts. Automaton has 132 states and 380 transitions. Word has length 57 [2018-06-24 21:00:04,537 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:04,537 INFO ]: Abstraction has 132 states and 380 transitions. [2018-06-24 21:00:04,537 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:00:04,537 INFO ]: Start isEmpty. Operand 132 states and 380 transitions. [2018-06-24 21:00:04,540 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-24 21:00:04,540 INFO ]: Found error trace [2018-06-24 21:00:04,540 INFO ]: trace histogram [10, 5, 4, 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, 1, 1, 1, 1, 1] [2018-06-24 21:00:04,540 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:04,540 INFO ]: Analyzing trace with hash 1538459633, now seen corresponding path program 1 times [2018-06-24 21:00:04,540 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:04,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:04,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:04,541 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:04,541 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:04,565 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:04,995 INFO ]: Checked inductivity of 165 backedges. 60 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-24 21:00:04,995 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:04,995 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,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:05,087 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:05,092 INFO ]: Computing forward predicates... [2018-06-24 21:00:05,646 INFO ]: Checked inductivity of 165 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-24 21:00:05,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:05,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 21:00:05,666 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:00:05,666 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:00:05,666 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:05,666 INFO ]: Start difference. First operand 132 states and 380 transitions. Second operand 17 states. [2018-06-24 21:00:06,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:06,815 INFO ]: Finished difference Result 207 states and 814 transitions. [2018-06-24 21:00:06,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:00:06,817 INFO ]: Start accepts. Automaton has 17 states. Word has length 57 [2018-06-24 21:00:06,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:06,819 INFO ]: With dead ends: 207 [2018-06-24 21:00:06,819 INFO ]: Without dead ends: 207 [2018-06-24 21:00:06,820 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 21:00:06,820 INFO ]: Start minimizeSevpa. Operand 207 states. [2018-06-24 21:00:06,847 INFO ]: Finished minimizeSevpa. Reduced states from 207 to 154. [2018-06-24 21:00:06,847 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-24 21:00:06,849 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 515 transitions. [2018-06-24 21:00:06,849 INFO ]: Start accepts. Automaton has 154 states and 515 transitions. Word has length 57 [2018-06-24 21:00:06,850 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:06,850 INFO ]: Abstraction has 154 states and 515 transitions. [2018-06-24 21:00:06,850 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:00:06,850 INFO ]: Start isEmpty. Operand 154 states and 515 transitions. [2018-06-24 21:00:06,853 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-24 21:00:06,853 INFO ]: Found error trace [2018-06-24 21:00:06,853 INFO ]: trace histogram [10, 5, 4, 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, 1, 1, 1, 1] [2018-06-24 21:00:06,853 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:06,853 INFO ]: Analyzing trace with hash -1490621429, now seen corresponding path program 2 times [2018-06-24 21:00:06,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:06,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:06,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:06,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:06,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:06,873 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:07,356 INFO ]: Checked inductivity of 176 backedges. 65 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-24 21:00:07,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:07,356 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,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:07,428 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:07,428 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:07,431 INFO ]: Computing forward predicates... [2018-06-24 21:00:07,534 INFO ]: Checked inductivity of 176 backedges. 90 proven. 29 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-24 21:00:07,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:07,553 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2018-06-24 21:00:07,553 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:00:07,554 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:00:07,554 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:00:07,554 INFO ]: Start difference. First operand 154 states and 515 transitions. Second operand 18 states. [2018-06-24 21:00:08,587 WARN ]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 21:00:09,206 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:09,206 INFO ]: Finished difference Result 241 states and 1134 transitions. [2018-06-24 21:00:09,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 21:00:09,209 INFO ]: Start accepts. Automaton has 18 states. Word has length 58 [2018-06-24 21:00:09,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:09,214 INFO ]: With dead ends: 241 [2018-06-24 21:00:09,214 INFO ]: Without dead ends: 241 [2018-06-24 21:00:09,215 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 21:00:09,215 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-24 21:00:09,261 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 149. [2018-06-24 21:00:09,261 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-24 21:00:09,263 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 487 transitions. [2018-06-24 21:00:09,263 INFO ]: Start accepts. Automaton has 149 states and 487 transitions. Word has length 58 [2018-06-24 21:00:09,264 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:09,264 INFO ]: Abstraction has 149 states and 487 transitions. [2018-06-24 21:00:09,264 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:00:09,264 INFO ]: Start isEmpty. Operand 149 states and 487 transitions. [2018-06-24 21:00:09,266 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 21:00:09,266 INFO ]: Found error trace [2018-06-24 21:00:09,266 INFO ]: trace histogram [9, 5, 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, 1, 1, 1, 1] [2018-06-24 21:00:09,266 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:09,267 INFO ]: Analyzing trace with hash 956003562, now seen corresponding path program 2 times [2018-06-24 21:00:09,268 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:09,268 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:09,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:09,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:09,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:09,284 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:10,256 INFO ]: Checked inductivity of 135 backedges. 32 proven. 60 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-24 21:00:10,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:10,256 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:10,262 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:10,322 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:10,322 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:10,324 INFO ]: Computing forward predicates... [2018-06-24 21:00:10,449 INFO ]: Checked inductivity of 135 backedges. 57 proven. 43 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-24 21:00:10,468 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:10,468 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21 [2018-06-24 21:00:10,468 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:00:10,468 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:00:10,468 INFO ]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:00:10,468 INFO ]: Start difference. First operand 149 states and 487 transitions. Second operand 21 states. [2018-06-24 21:00:11,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:11,831 INFO ]: Finished difference Result 195 states and 750 transitions. [2018-06-24 21:00:11,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:00:11,831 INFO ]: Start accepts. Automaton has 21 states. Word has length 52 [2018-06-24 21:00:11,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:11,834 INFO ]: With dead ends: 195 [2018-06-24 21:00:11,834 INFO ]: Without dead ends: 195 [2018-06-24 21:00:11,834 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:00:11,834 INFO ]: Start minimizeSevpa. Operand 195 states. [2018-06-24 21:00:11,857 INFO ]: Finished minimizeSevpa. Reduced states from 195 to 132. [2018-06-24 21:00:11,857 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 21:00:11,859 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 379 transitions. [2018-06-24 21:00:11,859 INFO ]: Start accepts. Automaton has 132 states and 379 transitions. Word has length 52 [2018-06-24 21:00:11,859 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:11,859 INFO ]: Abstraction has 132 states and 379 transitions. [2018-06-24 21:00:11,859 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:00:11,859 INFO ]: Start isEmpty. Operand 132 states and 379 transitions. [2018-06-24 21:00:11,862 INFO ]: Finished isEmpty. Found accepting run of length 64 [2018-06-24 21:00:11,862 INFO ]: Found error trace [2018-06-24 21:00:11,862 INFO ]: trace histogram [11, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:11,862 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:11,862 INFO ]: Analyzing trace with hash 1119847834, now seen corresponding path program 2 times [2018-06-24 21:00:11,862 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:11,862 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:11,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:11,862 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:11,863 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:11,883 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:12,190 INFO ]: Checked inductivity of 202 backedges. 70 proven. 45 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-06-24 21:00:12,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:12,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:12,195 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:12,265 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:12,265 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:12,269 INFO ]: Computing forward predicates... [2018-06-24 21:00:12,327 INFO ]: Checked inductivity of 202 backedges. 123 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-24 21:00:12,346 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:12,346 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15 [2018-06-24 21:00:12,346 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:00:12,347 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:00:12,347 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:00:12,347 INFO ]: Start difference. First operand 132 states and 379 transitions. Second operand 15 states. [2018-06-24 21:00:13,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:13,077 INFO ]: Finished difference Result 208 states and 869 transitions. [2018-06-24 21:00:13,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:00:13,077 INFO ]: Start accepts. Automaton has 15 states. Word has length 63 [2018-06-24 21:00:13,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:13,080 INFO ]: With dead ends: 208 [2018-06-24 21:00:13,080 INFO ]: Without dead ends: 208 [2018-06-24 21:00:13,081 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:00:13,081 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-24 21:00:13,111 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 143. [2018-06-24 21:00:13,111 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-24 21:00:13,113 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 457 transitions. [2018-06-24 21:00:13,113 INFO ]: Start accepts. Automaton has 143 states and 457 transitions. Word has length 63 [2018-06-24 21:00:13,114 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:13,114 INFO ]: Abstraction has 143 states and 457 transitions. [2018-06-24 21:00:13,114 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:00:13,114 INFO ]: Start isEmpty. Operand 143 states and 457 transitions. [2018-06-24 21:00:13,117 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-24 21:00:13,117 INFO ]: Found error trace [2018-06-24 21:00:13,117 INFO ]: trace histogram [11, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:13,117 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:13,117 INFO ]: Analyzing trace with hash -443231083, now seen corresponding path program 1 times [2018-06-24 21:00:13,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:13,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:13,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:13,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:13,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:13,139 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:13,979 INFO ]: Checked inductivity of 214 backedges. 82 proven. 34 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-24 21:00:13,979 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:13,979 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:13,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:14,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:14,067 INFO ]: Computing forward predicates... [2018-06-24 21:00:15,353 INFO ]: Checked inductivity of 214 backedges. 99 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-24 21:00:15,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:15,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-06-24 21:00:15,372 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:00:15,372 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:00:15,372 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:00:15,372 INFO ]: Start difference. First operand 143 states and 457 transitions. Second operand 22 states. [2018-06-24 21:00:16,302 WARN ]: Spent 218.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-06-24 21:00:17,535 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:17,535 INFO ]: Finished difference Result 185 states and 754 transitions. [2018-06-24 21:00:17,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:00:17,535 INFO ]: Start accepts. Automaton has 22 states. Word has length 64 [2018-06-24 21:00:17,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:17,538 INFO ]: With dead ends: 185 [2018-06-24 21:00:17,538 INFO ]: Without dead ends: 185 [2018-06-24 21:00:17,539 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=296, Invalid=2254, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:00:17,539 INFO ]: Start minimizeSevpa. Operand 185 states. [2018-06-24 21:00:17,561 INFO ]: Finished minimizeSevpa. Reduced states from 185 to 135. [2018-06-24 21:00:17,561 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-24 21:00:17,563 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 414 transitions. [2018-06-24 21:00:17,563 INFO ]: Start accepts. Automaton has 135 states and 414 transitions. Word has length 64 [2018-06-24 21:00:17,564 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:17,564 INFO ]: Abstraction has 135 states and 414 transitions. [2018-06-24 21:00:17,564 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:00:17,564 INFO ]: Start isEmpty. Operand 135 states and 414 transitions. [2018-06-24 21:00:17,566 INFO ]: Finished isEmpty. Found accepting run of length 69 [2018-06-24 21:00:17,566 INFO ]: Found error trace [2018-06-24 21:00:17,566 INFO ]: trace histogram [12, 6, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:17,567 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:17,569 INFO ]: Analyzing trace with hash 2131246453, now seen corresponding path program 3 times [2018-06-24 21:00:17,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:17,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:17,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:17,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:17,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:17,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:17,998 INFO ]: Checked inductivity of 240 backedges. 81 proven. 60 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-06-24 21:00:17,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:17,998 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:18,004 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:00:18,098 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 21:00:18,098 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:18,103 INFO ]: Computing forward predicates... [2018-06-24 21:00:18,298 INFO ]: Checked inductivity of 240 backedges. 132 proven. 37 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-24 21:00:18,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:18,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-06-24 21:00:18,317 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:00:18,317 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:00:18,318 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:00:18,318 INFO ]: Start difference. First operand 135 states and 414 transitions. Second operand 25 states. [2018-06-24 21:00:19,463 WARN ]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:00:21,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:21,059 INFO ]: Finished difference Result 186 states and 680 transitions. [2018-06-24 21:00:21,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 21:00:21,059 INFO ]: Start accepts. Automaton has 25 states. Word has length 68 [2018-06-24 21:00:21,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:21,061 INFO ]: With dead ends: 186 [2018-06-24 21:00:21,061 INFO ]: Without dead ends: 165 [2018-06-24 21:00:21,062 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=537, Invalid=4019, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 21:00:21,062 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-24 21:00:21,075 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 131. [2018-06-24 21:00:21,075 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-24 21:00:21,077 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 407 transitions. [2018-06-24 21:00:21,077 INFO ]: Start accepts. Automaton has 131 states and 407 transitions. Word has length 68 [2018-06-24 21:00:21,078 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:21,078 INFO ]: Abstraction has 131 states and 407 transitions. [2018-06-24 21:00:21,078 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:00:21,078 INFO ]: Start isEmpty. Operand 131 states and 407 transitions. [2018-06-24 21:00:21,080 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-24 21:00:21,080 INFO ]: Found error trace [2018-06-24 21:00:21,080 INFO ]: trace histogram [13, 7, 5, 3, 2, 2, 2, 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, 1, 1, 1] [2018-06-24 21:00:21,080 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:21,080 INFO ]: Analyzing trace with hash -888424146, now seen corresponding path program 4 times [2018-06-24 21:00:21,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:21,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:21,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:21,081 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:21,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:21,107 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:21,296 INFO ]: Checked inductivity of 286 backedges. 91 proven. 85 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 21:00:21,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:21,296 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:21,302 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:00:21,384 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:00:21,384 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:21,387 INFO ]: Computing forward predicates... [2018-06-24 21:00:21,419 INFO ]: Checked inductivity of 286 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-24 21:00:21,438 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:21,438 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2018-06-24 21:00:21,438 INFO ]: Interpolant automaton has 17 states [2018-06-24 21:00:21,438 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 21:00:21,438 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:00:21,438 INFO ]: Start difference. First operand 131 states and 407 transitions. Second operand 17 states. [2018-06-24 21:00:22,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:22,238 INFO ]: Finished difference Result 164 states and 574 transitions. [2018-06-24 21:00:22,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:00:22,238 INFO ]: Start accepts. Automaton has 17 states. Word has length 74 [2018-06-24 21:00:22,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:22,240 INFO ]: With dead ends: 164 [2018-06-24 21:00:22,240 INFO ]: Without dead ends: 164 [2018-06-24 21:00:22,240 INFO ]: 0 DeclaredPredicates, 122 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:00:22,240 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-24 21:00:22,254 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 136. [2018-06-24 21:00:22,254 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 21:00:22,256 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 433 transitions. [2018-06-24 21:00:22,256 INFO ]: Start accepts. Automaton has 136 states and 433 transitions. Word has length 74 [2018-06-24 21:00:22,256 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:22,256 INFO ]: Abstraction has 136 states and 433 transitions. [2018-06-24 21:00:22,256 INFO ]: Interpolant automaton has 17 states. [2018-06-24 21:00:22,256 INFO ]: Start isEmpty. Operand 136 states and 433 transitions. [2018-06-24 21:00:22,258 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-24 21:00:22,258 INFO ]: Found error trace [2018-06-24 21:00:22,258 INFO ]: trace histogram [13, 7, 5, 3, 2, 2, 2, 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, 1, 1, 1] [2018-06-24 21:00:22,258 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:22,258 INFO ]: Analyzing trace with hash 1454963522, now seen corresponding path program 5 times [2018-06-24 21:00:22,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:22,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:22,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:22,262 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:22,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:22,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:22,521 INFO ]: Checked inductivity of 286 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-06-24 21:00:22,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:22,521 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:22,527 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:00:22,633 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:00:22,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:22,636 INFO ]: Computing forward predicates... [2018-06-24 21:00:22,744 INFO ]: Checked inductivity of 286 backedges. 144 proven. 4 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-24 21:00:22,763 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:22,763 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 23 [2018-06-24 21:00:22,763 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:00:22,764 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:00:22,764 INFO ]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:00:22,764 INFO ]: Start difference. First operand 136 states and 433 transitions. Second operand 23 states. [2018-06-24 21:00:24,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:24,772 INFO ]: Finished difference Result 213 states and 898 transitions. [2018-06-24 21:00:24,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-06-24 21:00:24,775 INFO ]: Start accepts. Automaton has 23 states. Word has length 74 [2018-06-24 21:00:24,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:24,778 INFO ]: With dead ends: 213 [2018-06-24 21:00:24,778 INFO ]: Without dead ends: 213 [2018-06-24 21:00:24,779 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=722, Invalid=4828, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 21:00:24,779 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-24 21:00:24,807 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 163. [2018-06-24 21:00:24,807 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-24 21:00:24,814 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 593 transitions. [2018-06-24 21:00:24,814 INFO ]: Start accepts. Automaton has 163 states and 593 transitions. Word has length 74 [2018-06-24 21:00:24,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:24,814 INFO ]: Abstraction has 163 states and 593 transitions. [2018-06-24 21:00:24,814 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:00:24,814 INFO ]: Start isEmpty. Operand 163 states and 593 transitions. [2018-06-24 21:00:24,818 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-24 21:00:24,818 INFO ]: Found error trace [2018-06-24 21:00:24,818 INFO ]: trace histogram [11, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:00:24,818 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:24,818 INFO ]: Analyzing trace with hash -564899114, now seen corresponding path program 2 times [2018-06-24 21:00:24,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:24,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:24,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:24,819 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:24,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:24,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:25,036 INFO ]: Checked inductivity of 221 backedges. 45 proven. 103 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-24 21:00:25,036 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:25,036 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:25,043 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:00:25,119 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:00:25,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:25,123 INFO ]: Computing forward predicates... [2018-06-24 21:00:25,279 INFO ]: Checked inductivity of 221 backedges. 79 proven. 81 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-24 21:00:25,299 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:25,299 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2018-06-24 21:00:25,299 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:00:25,299 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:00:25,299 INFO ]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:00:25,299 INFO ]: Start difference. First operand 163 states and 593 transitions. Second operand 23 states. [2018-06-24 21:00:26,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:00:26,537 INFO ]: Finished difference Result 229 states and 1049 transitions. [2018-06-24 21:00:26,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:00:26,538 INFO ]: Start accepts. Automaton has 23 states. Word has length 64 [2018-06-24 21:00:26,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:00:26,540 INFO ]: With dead ends: 229 [2018-06-24 21:00:26,540 INFO ]: Without dead ends: 225 [2018-06-24 21:00:26,541 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:00:26,541 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-24 21:00:26,577 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 180. [2018-06-24 21:00:26,577 INFO ]: Start removeUnreachable. Operand 180 states. [2018-06-24 21:00:26,579 INFO ]: Finished removeUnreachable. Reduced from 180 states to 180 states and 683 transitions. [2018-06-24 21:00:26,579 INFO ]: Start accepts. Automaton has 180 states and 683 transitions. Word has length 64 [2018-06-24 21:00:26,579 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:00:26,579 INFO ]: Abstraction has 180 states and 683 transitions. [2018-06-24 21:00:26,579 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:00:26,579 INFO ]: Start isEmpty. Operand 180 states and 683 transitions. [2018-06-24 21:00:26,584 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-24 21:00:26,584 INFO ]: Found error trace [2018-06-24 21:00:26,584 INFO ]: trace histogram [14, 7, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-06-24 21:00:26,584 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:00:26,584 INFO ]: Analyzing trace with hash 697511279, now seen corresponding path program 1 times [2018-06-24 21:00:26,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:00:26,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:00:26,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:26,585 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:00:26,585 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:00:26,613 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,011 INFO ]: Checked inductivity of 353 backedges. 109 proven. 110 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-06-24 21:00:27,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:00:27,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:00:27,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:00:27,118 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:00:27,122 INFO ]: Computing forward predicates... [2018-06-24 21:00:28,465 INFO ]: Checked inductivity of 353 backedges. 152 proven. 88 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-24 21:00:28,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:00:28,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2018-06-24 21:00:28,485 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:00:28,485 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:00:28,486 INFO ]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:00:28,486 INFO ]: Start difference. First operand 180 states and 683 transitions. Second operand 31 states. Received shutdown request... [2018-06-24 21:00:28,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 21:00:28,839 WARN ]: Verification canceled [2018-06-24 21:00:28,841 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:00:28,842 WARN ]: Timeout [2018-06-24 21:00:28,842 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:00:28 BasicIcfg [2018-06-24 21:00:28,842 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:00:28,845 INFO ]: Toolchain (without parser) took 56339.69 ms. Allocated memory was 309.3 MB in the beginning and 908.6 MB in the end (delta: 599.3 MB). Free memory was 261.7 MB in the beginning and 714.9 MB in the end (delta: -453.2 MB). Peak memory consumption was 146.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:28,846 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:00:28,846 INFO ]: ChcToBoogie took 73.22 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 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:28,846 INFO ]: Boogie Preprocessor took 44.64 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.7 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:28,847 INFO ]: RCFGBuilder took 559.16 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 237.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:28,847 INFO ]: BlockEncodingV2 took 104.42 ms. Allocated memory is still 309.3 MB. Free memory was 237.8 MB in the beginning and 231.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:28,847 INFO ]: TraceAbstraction took 55547.29 ms. Allocated memory was 309.3 MB in the beginning and 908.6 MB in the end (delta: 599.3 MB). Free memory was 231.8 MB in the beginning and 714.9 MB in the end (delta: -483.2 MB). Peak memory consumption was 116.1 MB. Max. memory is 3.6 GB. [2018-06-24 21:00:28,851 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 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.22 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.64 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 559.16 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 237.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 104.42 ms. Allocated memory is still 309.3 MB. Free memory was 237.8 MB in the beginning and 231.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55547.29 ms. Allocated memory was 309.3 MB in the beginning and 908.6 MB in the end (delta: 599.3 MB). Free memory was 231.8 MB in the beginning and 714.9 MB in the end (delta: -483.2 MB). Peak memory consumption was 116.1 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 (180states) and interpolant automaton (currently 17 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. TIMEOUT Result, 55.4s OverallTime, 31 OverallIterations, 14 TraceHistogramMax, 34.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2120 SDtfs, 3262 SDslu, 13277 SDs, 0 SdLazy, 31667 SolverSat, 3598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2454 GetRequests, 1511 SyntacticMatches, 9 SemanticMatches, 933 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7599 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 994 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 2747 NumberOfCodeBlocks, 2709 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 2687 ConstructedInterpolants, 10 QuantifiedInterpolants, 384979 SizeOfPredicates, 318 NumberOfNonLiveVariables, 15765 ConjunctsInSsa, 652 ConjunctsInUnsatCore, 60 InterpolantComputations, 5 PerfectInterpolantSequences, 5794/7306 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/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-00-28-861.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-00-28-861.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-00-28-861.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/006-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-00-28-861.csv Completed graceful shutdown