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/vmt-chc-benchmarks/ctigar/up5.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 22:03:29,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 22:03:29,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 22:03:29,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 22:03:29,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 22:03:29,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 22:03:29,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 22:03:29,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 22:03:29,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 22:03:29,146 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 22:03:29,147 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 22:03:29,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 22:03:29,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 22:03:29,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 22:03:29,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 22:03:29,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 22:03:29,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 22:03:29,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 22:03:29,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 22:03:29,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 22:03:29,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 22:03:29,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 22:03:29,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 22:03:29,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 22:03:29,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 22:03:29,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 22:03:29,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 22:03:29,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 22:03:29,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 22:03:29,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 22:03:29,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 22:03:29,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 22:03:29,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 22:03:29,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 22:03:29,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 22:03:29,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 22:03:29,172 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 22:03:29,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 22:03:29,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 22:03:29,186 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 22:03:29,186 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 22:03:29,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 22:03:29,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 22:03:29,188 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 22:03:29,188 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 22:03:29,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 22:03:29,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 22:03:29,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 22:03:29,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 22:03:29,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:03:29,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 22:03:29,190 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 22:03:29,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 22:03:29,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 22:03:29,190 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 22:03:29,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 22:03:29,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 22:03:29,191 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 22:03:29,193 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 22:03:29,193 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 22:03:29,241 INFO ]: Repository-Root is: /tmp [2018-06-26 22:03:29,259 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 22:03:29,264 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 22:03:29,266 INFO ]: Initializing SmtParser... [2018-06-26 22:03:29,266 INFO ]: SmtParser initialized [2018-06-26 22:03:29,267 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/up5.c.smt2 [2018-06-26 22:03:29,268 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 22:03:29,357 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up5.c.smt2 unknown [2018-06-26 22:03:29,592 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/up5.c.smt2 [2018-06-26 22:03:29,601 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 22:03:29,609 INFO ]: Walking toolchain with 5 elements. [2018-06-26 22:03:29,609 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 22:03:29,609 INFO ]: Initializing ChcToBoogie... [2018-06-26 22:03:29,609 INFO ]: ChcToBoogie initialized [2018-06-26 22:03:29,613 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,676 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29 Unit [2018-06-26 22:03:29,676 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 22:03:29,677 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 22:03:29,677 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 22:03:29,677 INFO ]: Boogie Preprocessor initialized [2018-06-26 22:03:29,699 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,699 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,706 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,706 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,719 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,721 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,722 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:29,724 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 22:03:29,725 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 22:03:29,725 INFO ]: Initializing RCFGBuilder... [2018-06-26 22:03:29,725 INFO ]: RCFGBuilder initialized [2018-06-26 22:03:29,725 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 22:03:29,735 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 22:03:29,735 INFO ]: Found specification of procedure gotoProc [2018-06-26 22:03:29,735 INFO ]: Found implementation of procedure gotoProc [2018-06-26 22:03:29,735 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 22:03:29,735 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 22:03:29,735 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:03:29,977 INFO ]: Using library mode [2018-06-26 22:03:29,977 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:03:29 BoogieIcfgContainer [2018-06-26 22:03:29,977 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 22:03:29,978 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 22:03:29,978 INFO ]: Initializing BlockEncodingV2... [2018-06-26 22:03:29,978 INFO ]: BlockEncodingV2 initialized [2018-06-26 22:03:29,979 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:03:29" (1/1) ... [2018-06-26 22:03:30,001 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 22:03:30,002 INFO ]: Using Remove infeasible edges [2018-06-26 22:03:30,003 INFO ]: Using Maximize final states [2018-06-26 22:03:30,003 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 22:03:30,003 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 22:03:30,007 INFO ]: Using Remove sink states [2018-06-26 22:03:30,008 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 22:03:30,008 INFO ]: Using Use SBE [2018-06-26 22:03:30,024 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 22:03:34,969 INFO ]: SBE split 1 edges [2018-06-26 22:03:34,976 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 22:03:34,977 INFO ]: 0 new accepting states [2018-06-26 22:03:35,018 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 22:03:35,020 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:03:35,026 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 22:03:35,027 INFO ]: 0 new accepting states [2018-06-26 22:03:35,027 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 22:03:35,027 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:03:35,030 INFO ]: Encoded RCFG 6 locations, 87 edges [2018-06-26 22:03:35,031 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:03:35 BasicIcfg [2018-06-26 22:03:35,031 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 22:03:35,032 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 22:03:35,032 INFO ]: Initializing TraceAbstraction... [2018-06-26 22:03:35,036 INFO ]: TraceAbstraction initialized [2018-06-26 22:03:35,036 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:03:29" (1/4) ... [2018-06-26 22:03:35,037 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 10:03:35, skipping insertion in model container [2018-06-26 22:03:35,037 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:03:29" (2/4) ... [2018-06-26 22:03:35,037 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 10:03:35, skipping insertion in model container [2018-06-26 22:03:35,037 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:03:29" (3/4) ... [2018-06-26 22:03:35,037 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fad9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:03:35, skipping insertion in model container [2018-06-26 22:03:35,037 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:03:35" (4/4) ... [2018-06-26 22:03:35,039 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 22:03:35,049 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 22:03:35,056 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 22:03:35,092 INFO ]: Using default assertion order modulation [2018-06-26 22:03:35,093 INFO ]: Interprodecural is true [2018-06-26 22:03:35,093 INFO ]: Hoare is false [2018-06-26 22:03:35,093 INFO ]: Compute interpolants for FPandBP [2018-06-26 22:03:35,093 INFO ]: Backedges is TWOTRACK [2018-06-26 22:03:35,093 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 22:03:35,093 INFO ]: Difference is false [2018-06-26 22:03:35,093 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 22:03:35,093 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 22:03:35,102 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 22:03:35,116 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:03:35,116 INFO ]: Found error trace [2018-06-26 22:03:35,117 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:03:35,118 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:35,123 INFO ]: Analyzing trace with hash 37924226, now seen corresponding path program 1 times [2018-06-26 22:03:35,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:35,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:35,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:35,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:35,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:35,209 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:35,261 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:03:35,263 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:35,263 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:35,264 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:35,274 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:35,274 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:35,276 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 22:03:36,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:36,138 INFO ]: Finished difference Result 7 states and 124 transitions. [2018-06-26 22:03:36,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:36,153 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:03:36,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:36,163 INFO ]: With dead ends: 7 [2018-06-26 22:03:36,163 INFO ]: Without dead ends: 7 [2018-06-26 22:03:36,165 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:36,181 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 22:03:36,199 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 22:03:36,201 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:03:36,202 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2018-06-26 22:03:36,204 INFO ]: Start accepts. Automaton has 7 states and 124 transitions. Word has length 5 [2018-06-26 22:03:36,205 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:36,205 INFO ]: Abstraction has 7 states and 124 transitions. [2018-06-26 22:03:36,205 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:36,205 INFO ]: Start isEmpty. Operand 7 states and 124 transitions. [2018-06-26 22:03:36,205 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:03:36,205 INFO ]: Found error trace [2018-06-26 22:03:36,205 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:03:36,205 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:36,205 INFO ]: Analyzing trace with hash 1173348609, now seen corresponding path program 1 times [2018-06-26 22:03:36,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:36,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:36,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:36,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:36,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:36,223 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:36,293 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:03:36,294 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:36,294 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:36,295 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:36,295 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:36,295 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:36,295 INFO ]: Start difference. First operand 7 states and 124 transitions. Second operand 3 states. [2018-06-26 22:03:37,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:37,393 INFO ]: Finished difference Result 9 states and 187 transitions. [2018-06-26 22:03:37,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:37,394 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 22:03:37,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:37,395 INFO ]: With dead ends: 9 [2018-06-26 22:03:37,395 INFO ]: Without dead ends: 9 [2018-06-26 22:03:37,396 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:37,396 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:03:37,399 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 22:03:37,399 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:03:37,400 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2018-06-26 22:03:37,400 INFO ]: Start accepts. Automaton has 9 states and 187 transitions. Word has length 6 [2018-06-26 22:03:37,400 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:37,400 INFO ]: Abstraction has 9 states and 187 transitions. [2018-06-26 22:03:37,400 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:37,400 INFO ]: Start isEmpty. Operand 9 states and 187 transitions. [2018-06-26 22:03:37,401 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:03:37,401 INFO ]: Found error trace [2018-06-26 22:03:37,401 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:37,401 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:37,401 INFO ]: Analyzing trace with hash 2013404619, now seen corresponding path program 1 times [2018-06-26 22:03:37,401 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:37,401 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:37,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,402 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:37,402 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,419 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:37,449 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:03:37,449 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:37,449 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:37,450 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:37,450 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:37,450 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:37,450 INFO ]: Start difference. First operand 9 states and 187 transitions. Second operand 3 states. [2018-06-26 22:03:37,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:37,724 INFO ]: Finished difference Result 13 states and 266 transitions. [2018-06-26 22:03:37,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:37,724 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 22:03:37,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:37,725 INFO ]: With dead ends: 13 [2018-06-26 22:03:37,725 INFO ]: Without dead ends: 13 [2018-06-26 22:03:37,725 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:37,726 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:03:37,730 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:03:37,730 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:03:37,731 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2018-06-26 22:03:37,731 INFO ]: Start accepts. Automaton has 13 states and 266 transitions. Word has length 7 [2018-06-26 22:03:37,731 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:37,731 INFO ]: Abstraction has 13 states and 266 transitions. [2018-06-26 22:03:37,731 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:37,731 INFO ]: Start isEmpty. Operand 13 states and 266 transitions. [2018-06-26 22:03:37,731 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:03:37,732 INFO ]: Found error trace [2018-06-26 22:03:37,732 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:37,732 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:37,732 INFO ]: Analyzing trace with hash 1660766697, now seen corresponding path program 1 times [2018-06-26 22:03:37,732 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:37,732 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:37,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,733 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:37,733 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,743 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:37,760 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:03:37,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:37,760 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:37,760 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:37,760 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:37,760 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:37,760 INFO ]: Start difference. First operand 13 states and 266 transitions. Second operand 3 states. [2018-06-26 22:03:37,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:37,939 INFO ]: Finished difference Result 13 states and 182 transitions. [2018-06-26 22:03:37,939 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:37,939 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:03:37,939 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:37,939 INFO ]: With dead ends: 13 [2018-06-26 22:03:37,939 INFO ]: Without dead ends: 13 [2018-06-26 22:03:37,940 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:37,940 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:03:37,944 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:03:37,944 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:03:37,945 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 182 transitions. [2018-06-26 22:03:37,945 INFO ]: Start accepts. Automaton has 13 states and 182 transitions. Word has length 9 [2018-06-26 22:03:37,945 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:37,945 INFO ]: Abstraction has 13 states and 182 transitions. [2018-06-26 22:03:37,945 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:37,945 INFO ]: Start isEmpty. Operand 13 states and 182 transitions. [2018-06-26 22:03:37,945 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:03:37,945 INFO ]: Found error trace [2018-06-26 22:03:37,945 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:37,946 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:37,946 INFO ]: Analyzing trace with hash -1832584371, now seen corresponding path program 1 times [2018-06-26 22:03:37,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:37,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:37,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:37,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:37,979 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:38,012 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:03:38,012 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:38,012 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:38,012 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:38,012 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:38,012 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:38,012 INFO ]: Start difference. First operand 13 states and 182 transitions. Second operand 3 states. [2018-06-26 22:03:38,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:38,278 INFO ]: Finished difference Result 19 states and 219 transitions. [2018-06-26 22:03:38,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:38,279 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 22:03:38,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:38,279 INFO ]: With dead ends: 19 [2018-06-26 22:03:38,279 INFO ]: Without dead ends: 18 [2018-06-26 22:03:38,280 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:38,280 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 22:03:38,282 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 22:03:38,282 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 22:03:38,283 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 123 transitions. [2018-06-26 22:03:38,283 INFO ]: Start accepts. Automaton has 18 states and 123 transitions. Word has length 9 [2018-06-26 22:03:38,283 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:38,283 INFO ]: Abstraction has 18 states and 123 transitions. [2018-06-26 22:03:38,283 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:38,283 INFO ]: Start isEmpty. Operand 18 states and 123 transitions. [2018-06-26 22:03:38,283 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 22:03:38,283 INFO ]: Found error trace [2018-06-26 22:03:38,283 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:38,283 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:38,283 INFO ]: Analyzing trace with hash 287381894, now seen corresponding path program 1 times [2018-06-26 22:03:38,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:38,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:38,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:38,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:38,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:38,300 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:38,371 INFO ]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:03:38,371 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:38,371 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:38,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:38,425 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:38,433 INFO ]: Computing forward predicates... [2018-06-26 22:03:38,590 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:03:38,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:38,612 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 22:03:38,613 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:03:38,613 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:03:38,613 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:03:38,613 INFO ]: Start difference. First operand 18 states and 123 transitions. Second operand 8 states. [2018-06-26 22:03:38,900 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-06-26 22:03:40,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:40,890 INFO ]: Finished difference Result 181 states and 1320 transitions. [2018-06-26 22:03:40,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 22:03:40,890 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 22:03:40,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:40,895 INFO ]: With dead ends: 181 [2018-06-26 22:03:40,895 INFO ]: Without dead ends: 169 [2018-06-26 22:03:40,896 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-06-26 22:03:40,896 INFO ]: Start minimizeSevpa. Operand 169 states. [2018-06-26 22:03:40,916 INFO ]: Finished minimizeSevpa. Reduced states from 169 to 53. [2018-06-26 22:03:40,916 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-26 22:03:40,917 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 342 transitions. [2018-06-26 22:03:40,918 INFO ]: Start accepts. Automaton has 53 states and 342 transitions. Word has length 10 [2018-06-26 22:03:40,920 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:40,920 INFO ]: Abstraction has 53 states and 342 transitions. [2018-06-26 22:03:40,920 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:03:40,920 INFO ]: Start isEmpty. Operand 53 states and 342 transitions. [2018-06-26 22:03:40,920 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:03:40,920 INFO ]: Found error trace [2018-06-26 22:03:40,920 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:40,921 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:40,921 INFO ]: Analyzing trace with hash 1136231162, now seen corresponding path program 1 times [2018-06-26 22:03:40,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:40,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:40,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:40,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:40,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:40,942 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:40,985 INFO ]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:03:40,985 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:40,985 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:40,988 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:40,988 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:40,988 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:40,988 INFO ]: Start difference. First operand 53 states and 342 transitions. Second operand 3 states. [2018-06-26 22:03:41,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:41,572 INFO ]: Finished difference Result 77 states and 518 transitions. [2018-06-26 22:03:41,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:41,581 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 22:03:41,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:41,583 INFO ]: With dead ends: 77 [2018-06-26 22:03:41,583 INFO ]: Without dead ends: 75 [2018-06-26 22:03:41,583 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:41,583 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 22:03:41,591 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-06-26 22:03:41,591 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 22:03:41,601 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 470 transitions. [2018-06-26 22:03:41,601 INFO ]: Start accepts. Automaton has 72 states and 470 transitions. Word has length 14 [2018-06-26 22:03:41,601 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:41,601 INFO ]: Abstraction has 72 states and 470 transitions. [2018-06-26 22:03:41,602 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:41,602 INFO ]: Start isEmpty. Operand 72 states and 470 transitions. [2018-06-26 22:03:41,603 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:03:41,603 INFO ]: Found error trace [2018-06-26 22:03:41,603 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:41,603 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:41,603 INFO ]: Analyzing trace with hash -1008815360, now seen corresponding path program 1 times [2018-06-26 22:03:41,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:41,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:41,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:41,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:41,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:41,623 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:41,761 INFO ]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 22:03:41,761 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:41,761 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 22:03:41,761 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:03:41,761 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:03:41,761 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:03:41,761 INFO ]: Start difference. First operand 72 states and 470 transitions. Second operand 4 states. [2018-06-26 22:03:41,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:41,968 INFO ]: Finished difference Result 99 states and 594 transitions. [2018-06-26 22:03:41,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:03:41,968 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 22:03:41,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:41,969 INFO ]: With dead ends: 99 [2018-06-26 22:03:41,969 INFO ]: Without dead ends: 65 [2018-06-26 22:03:41,970 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:03:41,970 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-26 22:03:41,978 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-06-26 22:03:41,978 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 22:03:41,979 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 394 transitions. [2018-06-26 22:03:41,979 INFO ]: Start accepts. Automaton has 61 states and 394 transitions. Word has length 14 [2018-06-26 22:03:41,979 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:41,980 INFO ]: Abstraction has 61 states and 394 transitions. [2018-06-26 22:03:41,980 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:03:41,980 INFO ]: Start isEmpty. Operand 61 states and 394 transitions. [2018-06-26 22:03:41,981 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:03:41,981 INFO ]: Found error trace [2018-06-26 22:03:41,982 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:41,982 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:41,982 INFO ]: Analyzing trace with hash -1038667145, now seen corresponding path program 1 times [2018-06-26 22:03:41,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:41,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:41,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:41,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:41,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:42,035 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:42,140 INFO ]: Checked inductivity of 120 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 22:03:42,140 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:42,140 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:42,140 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:42,140 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:42,140 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:42,140 INFO ]: Start difference. First operand 61 states and 394 transitions. Second operand 3 states. [2018-06-26 22:03:42,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:42,438 INFO ]: Finished difference Result 103 states and 634 transitions. [2018-06-26 22:03:42,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:42,438 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-26 22:03:42,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:42,440 INFO ]: With dead ends: 103 [2018-06-26 22:03:42,440 INFO ]: Without dead ends: 74 [2018-06-26 22:03:42,440 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:42,440 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 22:03:42,446 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-06-26 22:03:42,446 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-26 22:03:42,447 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 353 transitions. [2018-06-26 22:03:42,447 INFO ]: Start accepts. Automaton has 73 states and 353 transitions. Word has length 20 [2018-06-26 22:03:42,447 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:42,447 INFO ]: Abstraction has 73 states and 353 transitions. [2018-06-26 22:03:42,447 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:42,447 INFO ]: Start isEmpty. Operand 73 states and 353 transitions. [2018-06-26 22:03:42,448 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 22:03:42,448 INFO ]: Found error trace [2018-06-26 22:03:42,448 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:42,448 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:42,449 INFO ]: Analyzing trace with hash 227510434, now seen corresponding path program 1 times [2018-06-26 22:03:42,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:42,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:42,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:42,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:42,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:42,488 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:42,593 INFO ]: Checked inductivity of 120 backedges. 45 proven. 61 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:03:42,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:42,593 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:42,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:42,811 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:42,816 INFO ]: Computing forward predicates... [2018-06-26 22:03:42,927 INFO ]: Checked inductivity of 120 backedges. 53 proven. 53 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-26 22:03:42,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:42,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-26 22:03:42,948 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:03:42,948 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:03:42,948 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:03:42,948 INFO ]: Start difference. First operand 73 states and 353 transitions. Second operand 8 states. [2018-06-26 22:03:44,278 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:44,278 INFO ]: Finished difference Result 274 states and 1234 transitions. [2018-06-26 22:03:44,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 22:03:44,278 INFO ]: Start accepts. Automaton has 8 states. Word has length 20 [2018-06-26 22:03:44,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:44,284 INFO ]: With dead ends: 274 [2018-06-26 22:03:44,284 INFO ]: Without dead ends: 274 [2018-06-26 22:03:44,284 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:03:44,284 INFO ]: Start minimizeSevpa. Operand 274 states. [2018-06-26 22:03:44,300 INFO ]: Finished minimizeSevpa. Reduced states from 274 to 161. [2018-06-26 22:03:44,300 INFO ]: Start removeUnreachable. Operand 161 states. [2018-06-26 22:03:44,303 INFO ]: Finished removeUnreachable. Reduced from 161 states to 161 states and 799 transitions. [2018-06-26 22:03:44,303 INFO ]: Start accepts. Automaton has 161 states and 799 transitions. Word has length 20 [2018-06-26 22:03:44,303 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:44,303 INFO ]: Abstraction has 161 states and 799 transitions. [2018-06-26 22:03:44,303 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:03:44,303 INFO ]: Start isEmpty. Operand 161 states and 799 transitions. [2018-06-26 22:03:44,305 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 22:03:44,305 INFO ]: Found error trace [2018-06-26 22:03:44,305 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:44,305 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:44,305 INFO ]: Analyzing trace with hash -183945685, now seen corresponding path program 2 times [2018-06-26 22:03:44,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:44,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:44,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:44,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,316 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:44,360 INFO ]: Checked inductivity of 136 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-26 22:03:44,360 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:44,360 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:44,360 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:44,360 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:44,360 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,360 INFO ]: Start difference. First operand 161 states and 799 transitions. Second operand 3 states. [2018-06-26 22:03:44,426 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:44,426 INFO ]: Finished difference Result 161 states and 594 transitions. [2018-06-26 22:03:44,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:44,427 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-26 22:03:44,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:44,427 INFO ]: With dead ends: 161 [2018-06-26 22:03:44,427 INFO ]: Without dead ends: 161 [2018-06-26 22:03:44,428 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,428 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-26 22:03:44,437 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 156. [2018-06-26 22:03:44,437 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-26 22:03:44,438 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 572 transitions. [2018-06-26 22:03:44,439 INFO ]: Start accepts. Automaton has 156 states and 572 transitions. Word has length 21 [2018-06-26 22:03:44,439 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:44,439 INFO ]: Abstraction has 156 states and 572 transitions. [2018-06-26 22:03:44,439 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:44,439 INFO ]: Start isEmpty. Operand 156 states and 572 transitions. [2018-06-26 22:03:44,440 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 22:03:44,440 INFO ]: Found error trace [2018-06-26 22:03:44,440 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:44,440 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:44,441 INFO ]: Analyzing trace with hash 1299126211, now seen corresponding path program 1 times [2018-06-26 22:03:44,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:44,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:44,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:44,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:44,510 INFO ]: Checked inductivity of 153 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-26 22:03:44,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:44,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:44,511 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:44,511 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:44,511 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,511 INFO ]: Start difference. First operand 156 states and 572 transitions. Second operand 3 states. [2018-06-26 22:03:44,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:44,702 INFO ]: Finished difference Result 151 states and 441 transitions. [2018-06-26 22:03:44,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:44,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 22 [2018-06-26 22:03:44,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:44,704 INFO ]: With dead ends: 151 [2018-06-26 22:03:44,704 INFO ]: Without dead ends: 151 [2018-06-26 22:03:44,704 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,704 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 22:03:44,711 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 115. [2018-06-26 22:03:44,711 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-26 22:03:44,712 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 349 transitions. [2018-06-26 22:03:44,712 INFO ]: Start accepts. Automaton has 115 states and 349 transitions. Word has length 22 [2018-06-26 22:03:44,712 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:44,712 INFO ]: Abstraction has 115 states and 349 transitions. [2018-06-26 22:03:44,712 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:44,712 INFO ]: Start isEmpty. Operand 115 states and 349 transitions. [2018-06-26 22:03:44,713 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 22:03:44,713 INFO ]: Found error trace [2018-06-26 22:03:44,713 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:44,713 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:44,714 INFO ]: Analyzing trace with hash -1968352077, now seen corresponding path program 3 times [2018-06-26 22:03:44,714 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:44,714 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:44,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:44,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:44,756 INFO ]: Checked inductivity of 171 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-06-26 22:03:44,756 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:03:44,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:03:44,757 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:03:44,757 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:03:44,757 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,757 INFO ]: Start difference. First operand 115 states and 349 transitions. Second operand 3 states. [2018-06-26 22:03:44,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:44,820 INFO ]: Finished difference Result 68 states and 133 transitions. [2018-06-26 22:03:44,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:03:44,820 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-26 22:03:44,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:44,820 INFO ]: With dead ends: 68 [2018-06-26 22:03:44,820 INFO ]: Without dead ends: 60 [2018-06-26 22:03:44,821 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:03:44,821 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 22:03:44,823 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-06-26 22:03:44,823 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 22:03:44,823 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 114 transitions. [2018-06-26 22:03:44,824 INFO ]: Start accepts. Automaton has 55 states and 114 transitions. Word has length 23 [2018-06-26 22:03:44,824 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:44,824 INFO ]: Abstraction has 55 states and 114 transitions. [2018-06-26 22:03:44,824 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:03:44,824 INFO ]: Start isEmpty. Operand 55 states and 114 transitions. [2018-06-26 22:03:44,824 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 22:03:44,824 INFO ]: Found error trace [2018-06-26 22:03:44,825 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:44,825 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:44,825 INFO ]: Analyzing trace with hash -150457316, now seen corresponding path program 4 times [2018-06-26 22:03:44,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:44,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:44,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:44,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:44,846 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:45,020 INFO ]: Checked inductivity of 190 backedges. 57 proven. 113 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 22:03:45,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:45,020 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:45,027 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:45,092 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:45,092 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:45,097 INFO ]: Computing forward predicates... [2018-06-26 22:03:45,165 INFO ]: Checked inductivity of 190 backedges. 65 proven. 105 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 22:03:45,186 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:45,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 22:03:45,186 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:03:45,186 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:03:45,186 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:03:45,186 INFO ]: Start difference. First operand 55 states and 114 transitions. Second operand 9 states. [2018-06-26 22:03:45,421 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:45,421 INFO ]: Finished difference Result 80 states and 158 transitions. [2018-06-26 22:03:45,422 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:03:45,422 INFO ]: Start accepts. Automaton has 9 states. Word has length 24 [2018-06-26 22:03:45,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:45,423 INFO ]: With dead ends: 80 [2018-06-26 22:03:45,423 INFO ]: Without dead ends: 80 [2018-06-26 22:03:45,423 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:03:45,423 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-26 22:03:45,425 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 67. [2018-06-26 22:03:45,425 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 22:03:45,426 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2018-06-26 22:03:45,426 INFO ]: Start accepts. Automaton has 67 states and 136 transitions. Word has length 24 [2018-06-26 22:03:45,426 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:45,426 INFO ]: Abstraction has 67 states and 136 transitions. [2018-06-26 22:03:45,426 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:03:45,426 INFO ]: Start isEmpty. Operand 67 states and 136 transitions. [2018-06-26 22:03:45,427 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 22:03:45,427 INFO ]: Found error trace [2018-06-26 22:03:45,427 INFO ]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:45,427 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:45,427 INFO ]: Analyzing trace with hash -722824554, now seen corresponding path program 5 times [2018-06-26 22:03:45,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:45,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:45,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:45,428 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:45,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:45,454 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:45,887 INFO ]: Checked inductivity of 276 backedges. 206 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-26 22:03:45,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:45,887 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) [2018-06-26 22:03:45,901 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:46,115 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-26 22:03:46,115 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:46,121 INFO ]: Computing forward predicates... [2018-06-26 22:03:46,141 INFO ]: Checked inductivity of 276 backedges. 206 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-26 22:03:46,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:46,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:03:46,172 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:03:46,172 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:03:46,172 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:03:46,173 INFO ]: Start difference. First operand 67 states and 136 transitions. Second operand 7 states. [2018-06-26 22:03:46,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:46,407 INFO ]: Finished difference Result 149 states and 294 transitions. [2018-06-26 22:03:46,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:03:46,407 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-26 22:03:46,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:46,408 INFO ]: With dead ends: 149 [2018-06-26 22:03:46,408 INFO ]: Without dead ends: 76 [2018-06-26 22:03:46,408 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:03:46,408 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-26 22:03:46,411 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-06-26 22:03:46,411 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-26 22:03:46,411 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 146 transitions. [2018-06-26 22:03:46,411 INFO ]: Start accepts. Automaton has 73 states and 146 transitions. Word has length 28 [2018-06-26 22:03:46,411 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:46,411 INFO ]: Abstraction has 73 states and 146 transitions. [2018-06-26 22:03:46,411 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:03:46,411 INFO ]: Start isEmpty. Operand 73 states and 146 transitions. [2018-06-26 22:03:46,412 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 22:03:46,412 INFO ]: Found error trace [2018-06-26 22:03:46,412 INFO ]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:46,412 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:46,412 INFO ]: Analyzing trace with hash -891252395, now seen corresponding path program 1 times [2018-06-26 22:03:46,412 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:46,412 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:46,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:46,413 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:46,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:46,438 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:47,330 INFO ]: Checked inductivity of 435 backedges. 101 proven. 290 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-06-26 22:03:47,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:47,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 22:03:47,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:47,462 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:47,469 INFO ]: Computing forward predicates... [2018-06-26 22:03:47,613 INFO ]: Checked inductivity of 435 backedges. 137 proven. 257 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-26 22:03:47,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:47,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-26 22:03:47,646 INFO ]: Interpolant automaton has 11 states [2018-06-26 22:03:47,646 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 22:03:47,646 INFO ]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:03:47,646 INFO ]: Start difference. First operand 73 states and 146 transitions. Second operand 11 states. [2018-06-26 22:03:48,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:48,162 INFO ]: Finished difference Result 98 states and 190 transitions. [2018-06-26 22:03:48,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 22:03:48,163 INFO ]: Start accepts. Automaton has 11 states. Word has length 34 [2018-06-26 22:03:48,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:48,165 INFO ]: With dead ends: 98 [2018-06-26 22:03:48,165 INFO ]: Without dead ends: 98 [2018-06-26 22:03:48,165 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-06-26 22:03:48,165 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-26 22:03:48,168 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-06-26 22:03:48,168 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-26 22:03:48,168 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 168 transitions. [2018-06-26 22:03:48,168 INFO ]: Start accepts. Automaton has 85 states and 168 transitions. Word has length 34 [2018-06-26 22:03:48,169 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:48,169 INFO ]: Abstraction has 85 states and 168 transitions. [2018-06-26 22:03:48,169 INFO ]: Interpolant automaton has 11 states. [2018-06-26 22:03:48,169 INFO ]: Start isEmpty. Operand 85 states and 168 transitions. [2018-06-26 22:03:48,169 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 22:03:48,169 INFO ]: Found error trace [2018-06-26 22:03:48,169 INFO ]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:48,170 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:48,171 INFO ]: Analyzing trace with hash 510634831, now seen corresponding path program 2 times [2018-06-26 22:03:48,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:48,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:48,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:48,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:48,172 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:48,200 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:48,434 INFO ]: Checked inductivity of 561 backedges. 113 proven. 398 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-26 22:03:48,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:48,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:48,442 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:48,591 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:48,591 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:48,599 INFO ]: Computing forward predicates... [2018-06-26 22:03:48,876 INFO ]: Checked inductivity of 561 backedges. 149 proven. 365 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-26 22:03:48,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:48,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-06-26 22:03:48,909 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:03:48,910 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:03:48,910 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:48,910 INFO ]: Start difference. First operand 85 states and 168 transitions. Second operand 12 states. [2018-06-26 22:03:49,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:49,409 INFO ]: Finished difference Result 110 states and 212 transitions. [2018-06-26 22:03:49,409 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 22:03:49,409 INFO ]: Start accepts. Automaton has 12 states. Word has length 38 [2018-06-26 22:03:49,409 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:49,410 INFO ]: With dead ends: 110 [2018-06-26 22:03:49,410 INFO ]: Without dead ends: 110 [2018-06-26 22:03:49,410 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-06-26 22:03:49,410 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-26 22:03:49,412 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 97. [2018-06-26 22:03:49,412 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-26 22:03:49,413 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 190 transitions. [2018-06-26 22:03:49,413 INFO ]: Start accepts. Automaton has 97 states and 190 transitions. Word has length 38 [2018-06-26 22:03:49,413 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:49,413 INFO ]: Abstraction has 97 states and 190 transitions. [2018-06-26 22:03:49,413 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:03:49,413 INFO ]: Start isEmpty. Operand 97 states and 190 transitions. [2018-06-26 22:03:49,414 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 22:03:49,414 INFO ]: Found error trace [2018-06-26 22:03:49,414 INFO ]: trace histogram [5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:49,414 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:49,414 INFO ]: Analyzing trace with hash -2138228663, now seen corresponding path program 3 times [2018-06-26 22:03:49,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:49,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:49,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:49,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:49,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:49,442 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:49,816 INFO ]: Checked inductivity of 703 backedges. 528 proven. 90 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 22:03:49,816 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:49,816 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:49,823 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:49,953 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-06-26 22:03:49,953 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:49,958 INFO ]: Computing forward predicates... [2018-06-26 22:03:49,982 INFO ]: Checked inductivity of 703 backedges. 528 proven. 90 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 22:03:50,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:50,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 22:03:50,008 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:03:50,008 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:03:50,008 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:03:50,008 INFO ]: Start difference. First operand 97 states and 190 transitions. Second operand 9 states. [2018-06-26 22:03:50,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:50,155 INFO ]: Finished difference Result 227 states and 436 transitions. [2018-06-26 22:03:50,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:03:50,156 INFO ]: Start accepts. Automaton has 9 states. Word has length 42 [2018-06-26 22:03:50,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:50,157 INFO ]: With dead ends: 227 [2018-06-26 22:03:50,157 INFO ]: Without dead ends: 106 [2018-06-26 22:03:50,157 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:03:50,157 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-26 22:03:50,160 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-06-26 22:03:50,160 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-26 22:03:50,161 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 200 transitions. [2018-06-26 22:03:50,161 INFO ]: Start accepts. Automaton has 103 states and 200 transitions. Word has length 42 [2018-06-26 22:03:50,161 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:50,161 INFO ]: Abstraction has 103 states and 200 transitions. [2018-06-26 22:03:50,161 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:03:50,161 INFO ]: Start isEmpty. Operand 103 states and 200 transitions. [2018-06-26 22:03:50,161 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-26 22:03:50,161 INFO ]: Found error trace [2018-06-26 22:03:50,162 INFO ]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:50,162 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:50,162 INFO ]: Analyzing trace with hash 602078408, now seen corresponding path program 4 times [2018-06-26 22:03:50,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:50,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:50,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:50,162 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:50,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:50,194 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:50,479 INFO ]: Checked inductivity of 946 backedges. 197 proven. 678 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-26 22:03:50,479 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:50,479 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:50,486 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:50,612 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:50,613 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:50,620 INFO ]: Computing forward predicates... [2018-06-26 22:03:50,677 INFO ]: Checked inductivity of 946 backedges. 257 proven. 621 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-26 22:03:50,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:50,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-06-26 22:03:50,708 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:03:50,708 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:03:50,708 INFO ]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:03:50,708 INFO ]: Start difference. First operand 103 states and 200 transitions. Second operand 14 states. [2018-06-26 22:03:51,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:51,295 INFO ]: Finished difference Result 128 states and 244 transitions. [2018-06-26 22:03:51,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 22:03:51,295 INFO ]: Start accepts. Automaton has 14 states. Word has length 48 [2018-06-26 22:03:51,295 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:51,295 INFO ]: With dead ends: 128 [2018-06-26 22:03:51,295 INFO ]: Without dead ends: 128 [2018-06-26 22:03:51,296 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2018-06-26 22:03:51,296 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 22:03:51,299 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-06-26 22:03:51,299 INFO ]: Start removeUnreachable. Operand 115 states. [2018-06-26 22:03:51,300 INFO ]: Finished removeUnreachable. Reduced from 115 states to 115 states and 222 transitions. [2018-06-26 22:03:51,300 INFO ]: Start accepts. Automaton has 115 states and 222 transitions. Word has length 48 [2018-06-26 22:03:51,300 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:51,300 INFO ]: Abstraction has 115 states and 222 transitions. [2018-06-26 22:03:51,300 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:03:51,300 INFO ]: Start isEmpty. Operand 115 states and 222 transitions. [2018-06-26 22:03:51,301 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-26 22:03:51,301 INFO ]: Found error trace [2018-06-26 22:03:51,301 INFO ]: trace histogram [6, 6, 6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:51,301 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:51,301 INFO ]: Analyzing trace with hash 278472002, now seen corresponding path program 5 times [2018-06-26 22:03:51,301 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:51,301 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:51,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:51,301 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:51,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:51,332 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:51,527 INFO ]: Checked inductivity of 1128 backedges. 209 proven. 842 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-06-26 22:03:51,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:51,527 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:51,532 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:03:51,708 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-06-26 22:03:51,708 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:51,718 INFO ]: Computing forward predicates... [2018-06-26 22:03:51,769 INFO ]: Checked inductivity of 1128 backedges. 269 proven. 785 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-06-26 22:03:51,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:51,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-06-26 22:03:51,789 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:03:51,789 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:03:51,790 INFO ]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:03:51,790 INFO ]: Start difference. First operand 115 states and 222 transitions. Second operand 15 states. [2018-06-26 22:03:52,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:52,298 INFO ]: Finished difference Result 140 states and 266 transitions. [2018-06-26 22:03:52,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 22:03:52,298 INFO ]: Start accepts. Automaton has 15 states. Word has length 52 [2018-06-26 22:03:52,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:52,298 INFO ]: With dead ends: 140 [2018-06-26 22:03:52,298 INFO ]: Without dead ends: 140 [2018-06-26 22:03:52,299 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2018-06-26 22:03:52,299 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 22:03:52,301 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 127. [2018-06-26 22:03:52,301 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-26 22:03:52,302 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 244 transitions. [2018-06-26 22:03:52,302 INFO ]: Start accepts. Automaton has 127 states and 244 transitions. Word has length 52 [2018-06-26 22:03:52,302 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:52,302 INFO ]: Abstraction has 127 states and 244 transitions. [2018-06-26 22:03:52,302 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:03:52,302 INFO ]: Start isEmpty. Operand 127 states and 244 transitions. [2018-06-26 22:03:52,303 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-26 22:03:52,303 INFO ]: Found error trace [2018-06-26 22:03:52,303 INFO ]: trace histogram [7, 7, 7, 7, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:52,303 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:52,303 INFO ]: Analyzing trace with hash -323845956, now seen corresponding path program 6 times [2018-06-26 22:03:52,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:52,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:52,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:52,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:52,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:52,337 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:52,557 INFO ]: Checked inductivity of 1326 backedges. 998 proven. 204 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 22:03:52,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:52,557 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:52,568 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:03:52,790 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-06-26 22:03:52,790 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:52,797 INFO ]: Computing forward predicates... [2018-06-26 22:03:52,826 INFO ]: Checked inductivity of 1326 backedges. 998 proven. 204 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 22:03:52,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:52,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 22:03:52,860 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:03:52,861 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:03:52,861 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:52,861 INFO ]: Start difference. First operand 127 states and 244 transitions. Second operand 12 states. [2018-06-26 22:03:53,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:53,047 INFO ]: Finished difference Result 305 states and 578 transitions. [2018-06-26 22:03:53,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:03:53,048 INFO ]: Start accepts. Automaton has 12 states. Word has length 56 [2018-06-26 22:03:53,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:53,049 INFO ]: With dead ends: 305 [2018-06-26 22:03:53,049 INFO ]: Without dead ends: 136 [2018-06-26 22:03:53,049 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:03:53,049 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-26 22:03:53,052 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-06-26 22:03:53,052 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 22:03:53,053 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 254 transitions. [2018-06-26 22:03:53,053 INFO ]: Start accepts. Automaton has 133 states and 254 transitions. Word has length 56 [2018-06-26 22:03:53,053 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:53,053 INFO ]: Abstraction has 133 states and 254 transitions. [2018-06-26 22:03:53,053 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:03:53,053 INFO ]: Start isEmpty. Operand 133 states and 254 transitions. [2018-06-26 22:03:53,054 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-26 22:03:53,054 INFO ]: Found error trace [2018-06-26 22:03:53,054 INFO ]: trace histogram [7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:53,054 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:53,054 INFO ]: Analyzing trace with hash 679148283, now seen corresponding path program 7 times [2018-06-26 22:03:53,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:53,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:53,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:53,055 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:53,055 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:53,091 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:53,307 INFO ]: Checked inductivity of 1653 backedges. 329 proven. 1226 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-26 22:03:53,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:53,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:53,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:53,511 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:53,520 INFO ]: Computing forward predicates... [2018-06-26 22:03:53,624 INFO ]: Checked inductivity of 1653 backedges. 413 proven. 1145 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-06-26 22:03:53,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:53,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-06-26 22:03:53,656 INFO ]: Interpolant automaton has 17 states [2018-06-26 22:03:53,656 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 22:03:53,657 INFO ]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:03:53,657 INFO ]: Start difference. First operand 133 states and 254 transitions. Second operand 17 states. [2018-06-26 22:03:54,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:54,353 INFO ]: Finished difference Result 158 states and 298 transitions. [2018-06-26 22:03:54,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 22:03:54,354 INFO ]: Start accepts. Automaton has 17 states. Word has length 62 [2018-06-26 22:03:54,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:54,355 INFO ]: With dead ends: 158 [2018-06-26 22:03:54,355 INFO ]: Without dead ends: 158 [2018-06-26 22:03:54,355 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 22:03:54,356 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-26 22:03:54,359 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-06-26 22:03:54,359 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-26 22:03:54,360 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 276 transitions. [2018-06-26 22:03:54,360 INFO ]: Start accepts. Automaton has 145 states and 276 transitions. Word has length 62 [2018-06-26 22:03:54,360 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:54,360 INFO ]: Abstraction has 145 states and 276 transitions. [2018-06-26 22:03:54,360 INFO ]: Interpolant automaton has 17 states. [2018-06-26 22:03:54,360 INFO ]: Start isEmpty. Operand 145 states and 276 transitions. [2018-06-26 22:03:54,361 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-26 22:03:54,361 INFO ]: Found error trace [2018-06-26 22:03:54,361 INFO ]: trace histogram [8, 8, 8, 8, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:54,361 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:54,361 INFO ]: Analyzing trace with hash -271527435, now seen corresponding path program 8 times [2018-06-26 22:03:54,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:54,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:54,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:54,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:03:54,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:54,401 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:54,969 INFO ]: Checked inductivity of 1891 backedges. 341 proven. 1446 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-26 22:03:54,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:54,969 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:54,976 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:03:55,139 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:03:55,140 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:55,148 INFO ]: Computing forward predicates... [2018-06-26 22:03:55,500 INFO ]: Checked inductivity of 1891 backedges. 425 proven. 1365 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-26 22:03:55,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:55,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 18 [2018-06-26 22:03:55,533 INFO ]: Interpolant automaton has 18 states [2018-06-26 22:03:55,533 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 22:03:55,533 INFO ]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:03:55,534 INFO ]: Start difference. First operand 145 states and 276 transitions. Second operand 18 states. [2018-06-26 22:03:56,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:56,697 INFO ]: Finished difference Result 170 states and 320 transitions. [2018-06-26 22:03:56,697 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 22:03:56,697 INFO ]: Start accepts. Automaton has 18 states. Word has length 66 [2018-06-26 22:03:56,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:56,698 INFO ]: With dead ends: 170 [2018-06-26 22:03:56,698 INFO ]: Without dead ends: 170 [2018-06-26 22:03:56,698 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 22:03:56,698 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-26 22:03:56,701 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-06-26 22:03:56,701 INFO ]: Start removeUnreachable. Operand 157 states. [2018-06-26 22:03:56,702 INFO ]: Finished removeUnreachable. Reduced from 157 states to 157 states and 298 transitions. [2018-06-26 22:03:56,702 INFO ]: Start accepts. Automaton has 157 states and 298 transitions. Word has length 66 [2018-06-26 22:03:56,702 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:56,702 INFO ]: Abstraction has 157 states and 298 transitions. [2018-06-26 22:03:56,702 INFO ]: Interpolant automaton has 18 states. [2018-06-26 22:03:56,702 INFO ]: Start isEmpty. Operand 157 states and 298 transitions. [2018-06-26 22:03:56,703 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-26 22:03:56,703 INFO ]: Found error trace [2018-06-26 22:03:56,703 INFO ]: trace histogram [9, 9, 9, 9, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:56,703 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:56,703 INFO ]: Analyzing trace with hash -636576785, now seen corresponding path program 9 times [2018-06-26 22:03:56,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:56,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:56,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:56,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:56,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:56,752 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:56,990 INFO ]: Checked inductivity of 2145 backedges. 1616 proven. 366 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 22:03:56,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:56,990 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:57,002 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:03:57,311 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-06-26 22:03:57,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:57,341 INFO ]: Computing forward predicates... [2018-06-26 22:03:57,374 INFO ]: Checked inductivity of 2145 backedges. 1616 proven. 366 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 22:03:57,407 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:57,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 22:03:57,408 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:03:57,408 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:03:57,408 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:03:57,408 INFO ]: Start difference. First operand 157 states and 298 transitions. Second operand 14 states. [2018-06-26 22:03:57,835 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:03:57,835 INFO ]: Finished difference Result 383 states and 720 transitions. [2018-06-26 22:03:57,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 22:03:57,835 INFO ]: Start accepts. Automaton has 14 states. Word has length 70 [2018-06-26 22:03:57,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:03:57,836 INFO ]: With dead ends: 383 [2018-06-26 22:03:57,836 INFO ]: Without dead ends: 166 [2018-06-26 22:03:57,836 INFO ]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:03:57,836 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-26 22:03:57,839 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-06-26 22:03:57,839 INFO ]: Start removeUnreachable. Operand 163 states. [2018-06-26 22:03:57,840 INFO ]: Finished removeUnreachable. Reduced from 163 states to 163 states and 308 transitions. [2018-06-26 22:03:57,840 INFO ]: Start accepts. Automaton has 163 states and 308 transitions. Word has length 70 [2018-06-26 22:03:57,840 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:03:57,840 INFO ]: Abstraction has 163 states and 308 transitions. [2018-06-26 22:03:57,840 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:03:57,840 INFO ]: Start isEmpty. Operand 163 states and 308 transitions. [2018-06-26 22:03:57,841 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-26 22:03:57,841 INFO ]: Found error trace [2018-06-26 22:03:57,841 INFO ]: trace histogram [9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:03:57,841 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:03:57,841 INFO ]: Analyzing trace with hash -2055685138, now seen corresponding path program 10 times [2018-06-26 22:03:57,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:03:57,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:03:57,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:57,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:03:57,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:03:57,896 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:58,876 INFO ]: Checked inductivity of 2556 backedges. 497 proven. 1934 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-06-26 22:03:58,876 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:03:58,876 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:03:58,882 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:03:59,083 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:03:59,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:03:59,096 INFO ]: Computing forward predicates... [2018-06-26 22:03:59,177 INFO ]: Checked inductivity of 2556 backedges. 605 proven. 1829 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-06-26 22:03:59,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:03:59,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-06-26 22:03:59,197 INFO ]: Interpolant automaton has 20 states [2018-06-26 22:03:59,197 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 22:03:59,197 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-26 22:03:59,197 INFO ]: Start difference. First operand 163 states and 308 transitions. Second operand 20 states. [2018-06-26 22:04:00,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:00,158 INFO ]: Finished difference Result 188 states and 352 transitions. [2018-06-26 22:04:00,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 22:04:00,159 INFO ]: Start accepts. Automaton has 20 states. Word has length 76 [2018-06-26 22:04:00,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:00,160 INFO ]: With dead ends: 188 [2018-06-26 22:04:00,160 INFO ]: Without dead ends: 188 [2018-06-26 22:04:00,160 INFO ]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 22:04:00,160 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-26 22:04:00,163 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-06-26 22:04:00,163 INFO ]: Start removeUnreachable. Operand 175 states. [2018-06-26 22:04:00,164 INFO ]: Finished removeUnreachable. Reduced from 175 states to 175 states and 330 transitions. [2018-06-26 22:04:00,164 INFO ]: Start accepts. Automaton has 175 states and 330 transitions. Word has length 76 [2018-06-26 22:04:00,164 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:00,164 INFO ]: Abstraction has 175 states and 330 transitions. [2018-06-26 22:04:00,164 INFO ]: Interpolant automaton has 20 states. [2018-06-26 22:04:00,164 INFO ]: Start isEmpty. Operand 175 states and 330 transitions. [2018-06-26 22:04:00,165 INFO ]: Finished isEmpty. Found accepting run of length 81 [2018-06-26 22:04:00,165 INFO ]: Found error trace [2018-06-26 22:04:00,165 INFO ]: trace histogram [10, 10, 10, 10, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:00,165 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:00,165 INFO ]: Analyzing trace with hash 625926504, now seen corresponding path program 11 times [2018-06-26 22:04:00,165 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:00,165 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:00,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:00,166 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:00,166 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:00,208 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:00,616 INFO ]: Checked inductivity of 2850 backedges. 509 proven. 2210 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-06-26 22:04:00,616 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:00,616 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:00,623 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:04:00,978 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2018-06-26 22:04:00,978 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:00,996 INFO ]: Computing forward predicates... [2018-06-26 22:04:01,047 INFO ]: Checked inductivity of 2850 backedges. 617 proven. 2105 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-26 22:04:01,069 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:01,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-06-26 22:04:01,070 INFO ]: Interpolant automaton has 21 states [2018-06-26 22:04:01,070 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 22:04:01,070 INFO ]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-06-26 22:04:01,070 INFO ]: Start difference. First operand 175 states and 330 transitions. Second operand 21 states. [2018-06-26 22:04:01,987 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:01,987 INFO ]: Finished difference Result 200 states and 374 transitions. [2018-06-26 22:04:01,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 22:04:01,987 INFO ]: Start accepts. Automaton has 21 states. Word has length 80 [2018-06-26 22:04:01,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:01,988 INFO ]: With dead ends: 200 [2018-06-26 22:04:01,988 INFO ]: Without dead ends: 200 [2018-06-26 22:04:01,988 INFO ]: 0 DeclaredPredicates, 177 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=534, Invalid=1358, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 22:04:01,988 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-26 22:04:01,991 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 187. [2018-06-26 22:04:01,991 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-26 22:04:01,992 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 352 transitions. [2018-06-26 22:04:01,992 INFO ]: Start accepts. Automaton has 187 states and 352 transitions. Word has length 80 [2018-06-26 22:04:01,993 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:01,993 INFO ]: Abstraction has 187 states and 352 transitions. [2018-06-26 22:04:01,993 INFO ]: Interpolant automaton has 21 states. [2018-06-26 22:04:01,993 INFO ]: Start isEmpty. Operand 187 states and 352 transitions. [2018-06-26 22:04:01,993 INFO ]: Finished isEmpty. Found accepting run of length 85 [2018-06-26 22:04:01,993 INFO ]: Found error trace [2018-06-26 22:04:01,993 INFO ]: trace histogram [11, 11, 11, 11, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:01,994 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:01,994 INFO ]: Analyzing trace with hash -96355870, now seen corresponding path program 12 times [2018-06-26 22:04:01,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:01,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:01,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:01,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:01,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:02,040 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:02,923 INFO ]: Checked inductivity of 3160 backedges. 2382 proven. 576 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-06-26 22:04:02,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:02,923 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:02,929 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:04:03,275 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-06-26 22:04:03,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:03,288 INFO ]: Computing forward predicates... [2018-06-26 22:04:03,332 INFO ]: Checked inductivity of 3160 backedges. 2382 proven. 576 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-06-26 22:04:03,360 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:03,360 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 22:04:03,360 INFO ]: Interpolant automaton has 17 states [2018-06-26 22:04:03,360 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 22:04:03,360 INFO ]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:04:03,361 INFO ]: Start difference. First operand 187 states and 352 transitions. Second operand 17 states. [2018-06-26 22:04:03,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:03,627 INFO ]: Finished difference Result 461 states and 862 transitions. [2018-06-26 22:04:03,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 22:04:03,628 INFO ]: Start accepts. Automaton has 17 states. Word has length 84 [2018-06-26 22:04:03,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:03,629 INFO ]: With dead ends: 461 [2018-06-26 22:04:03,629 INFO ]: Without dead ends: 196 [2018-06-26 22:04:03,629 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:04:03,630 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-26 22:04:03,633 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-06-26 22:04:03,633 INFO ]: Start removeUnreachable. Operand 193 states. [2018-06-26 22:04:03,634 INFO ]: Finished removeUnreachable. Reduced from 193 states to 193 states and 362 transitions. [2018-06-26 22:04:03,634 INFO ]: Start accepts. Automaton has 193 states and 362 transitions. Word has length 84 [2018-06-26 22:04:03,634 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:03,634 INFO ]: Abstraction has 193 states and 362 transitions. [2018-06-26 22:04:03,634 INFO ]: Interpolant automaton has 17 states. [2018-06-26 22:04:03,634 INFO ]: Start isEmpty. Operand 193 states and 362 transitions. [2018-06-26 22:04:03,635 INFO ]: Finished isEmpty. Found accepting run of length 91 [2018-06-26 22:04:03,635 INFO ]: Found error trace [2018-06-26 22:04:03,635 INFO ]: trace histogram [11, 11, 11, 11, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:03,635 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:03,635 INFO ]: Analyzing trace with hash 2006478753, now seen corresponding path program 13 times [2018-06-26 22:04:03,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:03,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:03,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:03,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:03,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:03,677 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:04,576 INFO ]: Checked inductivity of 3655 backedges. 701 proven. 2802 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-26 22:04:04,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:04,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:04,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:04,808 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:04,826 INFO ]: Computing forward predicates... [2018-06-26 22:04:04,959 INFO ]: Checked inductivity of 3655 backedges. 833 proven. 2673 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-06-26 22:04:04,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:04,993 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2018-06-26 22:04:04,993 INFO ]: Interpolant automaton has 23 states [2018-06-26 22:04:04,993 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 22:04:04,993 INFO ]: CoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-06-26 22:04:04,993 INFO ]: Start difference. First operand 193 states and 362 transitions. Second operand 23 states. [2018-06-26 22:04:06,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:06,099 INFO ]: Finished difference Result 218 states and 406 transitions. [2018-06-26 22:04:06,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 22:04:06,099 INFO ]: Start accepts. Automaton has 23 states. Word has length 90 [2018-06-26 22:04:06,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:06,100 INFO ]: With dead ends: 218 [2018-06-26 22:04:06,100 INFO ]: Without dead ends: 218 [2018-06-26 22:04:06,101 INFO ]: 0 DeclaredPredicates, 199 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=623, Invalid=1633, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 22:04:06,101 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-26 22:04:06,103 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-06-26 22:04:06,103 INFO ]: Start removeUnreachable. Operand 205 states. [2018-06-26 22:04:06,104 INFO ]: Finished removeUnreachable. Reduced from 205 states to 205 states and 384 transitions. [2018-06-26 22:04:06,104 INFO ]: Start accepts. Automaton has 205 states and 384 transitions. Word has length 90 [2018-06-26 22:04:06,104 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:06,104 INFO ]: Abstraction has 205 states and 384 transitions. [2018-06-26 22:04:06,104 INFO ]: Interpolant automaton has 23 states. [2018-06-26 22:04:06,104 INFO ]: Start isEmpty. Operand 205 states and 384 transitions. [2018-06-26 22:04:06,105 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-26 22:04:06,105 INFO ]: Found error trace [2018-06-26 22:04:06,105 INFO ]: trace histogram [12, 12, 12, 12, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:06,105 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:06,105 INFO ]: Analyzing trace with hash -734559333, now seen corresponding path program 14 times [2018-06-26 22:04:06,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:06,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:06,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:06,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:06,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:06,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:06,535 INFO ]: Checked inductivity of 4005 backedges. 713 proven. 3134 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-06-26 22:04:06,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:06,535 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:06,544 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:04:06,849 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:04:06,849 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:06,868 INFO ]: Computing forward predicates... [2018-06-26 22:04:07,664 INFO ]: Checked inductivity of 4005 backedges. 845 proven. 3005 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-06-26 22:04:07,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:07,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 24 [2018-06-26 22:04:07,698 INFO ]: Interpolant automaton has 24 states [2018-06-26 22:04:07,698 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 22:04:07,699 INFO ]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-06-26 22:04:07,699 INFO ]: Start difference. First operand 205 states and 384 transitions. Second operand 24 states. [2018-06-26 22:04:09,164 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:09,164 INFO ]: Finished difference Result 230 states and 428 transitions. [2018-06-26 22:04:09,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 22:04:09,164 INFO ]: Start accepts. Automaton has 24 states. Word has length 94 [2018-06-26 22:04:09,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:09,166 INFO ]: With dead ends: 230 [2018-06-26 22:04:09,166 INFO ]: Without dead ends: 230 [2018-06-26 22:04:09,167 INFO ]: 0 DeclaredPredicates, 209 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=710, Invalid=1840, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 22:04:09,167 INFO ]: Start minimizeSevpa. Operand 230 states. [2018-06-26 22:04:09,170 INFO ]: Finished minimizeSevpa. Reduced states from 230 to 217. [2018-06-26 22:04:09,170 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-26 22:04:09,171 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 406 transitions. [2018-06-26 22:04:09,171 INFO ]: Start accepts. Automaton has 217 states and 406 transitions. Word has length 94 [2018-06-26 22:04:09,171 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:09,171 INFO ]: Abstraction has 217 states and 406 transitions. [2018-06-26 22:04:09,171 INFO ]: Interpolant automaton has 24 states. [2018-06-26 22:04:09,171 INFO ]: Start isEmpty. Operand 217 states and 406 transitions. [2018-06-26 22:04:09,172 INFO ]: Finished isEmpty. Found accepting run of length 99 [2018-06-26 22:04:09,172 INFO ]: Found error trace [2018-06-26 22:04:09,172 INFO ]: trace histogram [13, 13, 13, 13, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:09,172 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:09,173 INFO ]: Analyzing trace with hash -489157995, now seen corresponding path program 15 times [2018-06-26 22:04:09,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:09,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:09,173 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:09,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:09,228 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:09,934 INFO ]: Checked inductivity of 4371 backedges. 3296 proven. 834 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-06-26 22:04:09,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:09,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:09,941 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:04:10,447 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-06-26 22:04:10,447 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:10,463 INFO ]: Computing forward predicates... [2018-06-26 22:04:10,505 INFO ]: Checked inductivity of 4371 backedges. 3296 proven. 834 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-06-26 22:04:10,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:10,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 22:04:10,544 INFO ]: Interpolant automaton has 19 states [2018-06-26 22:04:10,544 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 22:04:10,544 INFO ]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-26 22:04:10,544 INFO ]: Start difference. First operand 217 states and 406 transitions. Second operand 19 states. [2018-06-26 22:04:10,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:10,958 INFO ]: Finished difference Result 539 states and 1004 transitions. [2018-06-26 22:04:10,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 22:04:10,959 INFO ]: Start accepts. Automaton has 19 states. Word has length 98 [2018-06-26 22:04:10,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:10,960 INFO ]: With dead ends: 539 [2018-06-26 22:04:10,960 INFO ]: Without dead ends: 226 [2018-06-26 22:04:10,961 INFO ]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-06-26 22:04:10,961 INFO ]: Start minimizeSevpa. Operand 226 states. [2018-06-26 22:04:10,968 INFO ]: Finished minimizeSevpa. Reduced states from 226 to 223. [2018-06-26 22:04:10,968 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-26 22:04:10,968 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 416 transitions. [2018-06-26 22:04:10,969 INFO ]: Start accepts. Automaton has 223 states and 416 transitions. Word has length 98 [2018-06-26 22:04:10,969 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:10,969 INFO ]: Abstraction has 223 states and 416 transitions. [2018-06-26 22:04:10,969 INFO ]: Interpolant automaton has 19 states. [2018-06-26 22:04:10,969 INFO ]: Start isEmpty. Operand 223 states and 416 transitions. [2018-06-26 22:04:10,972 INFO ]: Finished isEmpty. Found accepting run of length 105 [2018-06-26 22:04:10,972 INFO ]: Found error trace [2018-06-26 22:04:10,972 INFO ]: trace histogram [13, 13, 13, 13, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:10,972 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:10,972 INFO ]: Analyzing trace with hash 2122466836, now seen corresponding path program 16 times [2018-06-26 22:04:10,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:10,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:10,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:10,973 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:10,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:11,028 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:11,656 INFO ]: Checked inductivity of 4950 backedges. 941 proven. 3830 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-06-26 22:04:11,656 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:11,656 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:11,661 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:04:11,928 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:04:11,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:11,943 INFO ]: Computing forward predicates... [2018-06-26 22:04:12,364 INFO ]: Checked inductivity of 4950 backedges. 1097 proven. 3677 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-06-26 22:04:12,385 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:12,385 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-06-26 22:04:12,385 INFO ]: Interpolant automaton has 26 states [2018-06-26 22:04:12,386 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 22:04:12,386 INFO ]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-06-26 22:04:12,386 INFO ]: Start difference. First operand 223 states and 416 transitions. Second operand 26 states. [2018-06-26 22:04:13,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:13,672 INFO ]: Finished difference Result 248 states and 460 transitions. [2018-06-26 22:04:13,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 22:04:13,672 INFO ]: Start accepts. Automaton has 26 states. Word has length 104 [2018-06-26 22:04:13,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:13,673 INFO ]: With dead ends: 248 [2018-06-26 22:04:13,673 INFO ]: Without dead ends: 248 [2018-06-26 22:04:13,674 INFO ]: 0 DeclaredPredicates, 231 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=812, Invalid=2158, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 22:04:13,674 INFO ]: Start minimizeSevpa. Operand 248 states. [2018-06-26 22:04:13,679 INFO ]: Finished minimizeSevpa. Reduced states from 248 to 235. [2018-06-26 22:04:13,680 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-26 22:04:13,680 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 438 transitions. [2018-06-26 22:04:13,680 INFO ]: Start accepts. Automaton has 235 states and 438 transitions. Word has length 104 [2018-06-26 22:04:13,680 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:13,680 INFO ]: Abstraction has 235 states and 438 transitions. [2018-06-26 22:04:13,681 INFO ]: Interpolant automaton has 26 states. [2018-06-26 22:04:13,681 INFO ]: Start isEmpty. Operand 235 states and 438 transitions. [2018-06-26 22:04:13,683 INFO ]: Finished isEmpty. Found accepting run of length 109 [2018-06-26 22:04:13,683 INFO ]: Found error trace [2018-06-26 22:04:13,683 INFO ]: trace histogram [14, 14, 14, 14, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:13,683 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:13,683 INFO ]: Analyzing trace with hash 211478670, now seen corresponding path program 17 times [2018-06-26 22:04:13,683 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:13,683 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:13,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:13,683 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:04:13,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:13,737 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:14,206 INFO ]: Checked inductivity of 5356 backedges. 953 proven. 4218 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-06-26 22:04:14,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:14,206 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:14,212 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:04:14,788 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2018-06-26 22:04:14,788 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:14,814 INFO ]: Computing forward predicates... [2018-06-26 22:04:15,670 INFO ]: Checked inductivity of 5356 backedges. 1109 proven. 4065 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-06-26 22:04:15,703 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:15,703 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2018-06-26 22:04:15,703 INFO ]: Interpolant automaton has 27 states [2018-06-26 22:04:15,703 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 22:04:15,704 INFO ]: CoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2018-06-26 22:04:15,704 INFO ]: Start difference. First operand 235 states and 438 transitions. Second operand 27 states. Received shutdown request... [2018-06-26 22:04:21,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 22:04:21,042 WARN ]: Verification canceled [2018-06-26 22:04:21,044 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:04:21,045 WARN ]: Timeout [2018-06-26 22:04:21,045 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:04:21 BasicIcfg [2018-06-26 22:04:21,045 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:04:21,046 INFO ]: Toolchain (without parser) took 51444.89 ms. Allocated memory was 307.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 261.5 MB in the beginning and 689.9 MB in the end (delta: -428.3 MB). Peak memory consumption was 846.2 MB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,047 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:04:21,047 INFO ]: ChcToBoogie took 67.22 ms. Allocated memory is still 307.2 MB. Free memory was 260.5 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,047 INFO ]: Boogie Preprocessor took 47.29 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,048 INFO ]: RCFGBuilder took 252.62 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 248.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,049 INFO ]: BlockEncodingV2 took 5053.23 ms. Allocated memory was 307.2 MB in the beginning and 1.1 GB in the end (delta: 765.5 MB). Free memory was 248.6 MB in the beginning and 370.4 MB in the end (delta: -121.9 MB). Peak memory consumption was 655.2 MB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,049 INFO ]: TraceAbstraction took 46013.13 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 509.1 MB). Free memory was 370.4 MB in the beginning and 689.9 MB in the end (delta: -319.5 MB). Peak memory consumption was 189.6 MB. Max. memory is 3.6 GB. [2018-06-26 22:04:21,052 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 87 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.22 ms. Allocated memory is still 307.2 MB. Free memory was 260.5 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.29 ms. Allocated memory is still 307.2 MB. Free memory was 258.6 MB in the beginning and 257.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 252.62 ms. Allocated memory is still 307.2 MB. Free memory was 257.6 MB in the beginning and 248.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 5053.23 ms. Allocated memory was 307.2 MB in the beginning and 1.1 GB in the end (delta: 765.5 MB). Free memory was 248.6 MB in the beginning and 370.4 MB in the end (delta: -121.9 MB). Peak memory consumption was 655.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46013.13 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 509.1 MB). Free memory was 370.4 MB in the beginning and 689.9 MB in the end (delta: -319.5 MB). Peak memory consumption was 189.6 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 (235states) and interpolant automaton (currently 32 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 45.9s OverallTime, 32 OverallIterations, 14 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 185 SDtfs, 57 SDslu, 940 SDs, 0 SdLazy, 16901 SolverSat, 7209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2773 GetRequests, 2210 SyntacticMatches, 0 SemanticMatches, 562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 457 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2718 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 343 NumberOfCheckSat, 2665 ConstructedInterpolants, 0 QuantifiedInterpolants, 693861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 34385 ConjunctsInSsa, 3024 ConjunctsInUnsatCore, 53 InterpolantComputations, 11 PerfectInterpolantSequences, 35850/85278 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/up5.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-04-21-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up5.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-04-21-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up5.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-04-21-062.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/up5.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-04-21-062.csv Completed graceful shutdown