java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:50:22,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:50:22,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:50:22,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:50:22,138 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:50:22,139 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:50:22,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:50:22,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:50:22,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:50:22,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:50:22,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:50:22,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:50:22,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:50:22,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:50:22,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:50:22,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:50:22,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:50:22,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:50:22,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:50:22,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:50:22,176 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:50:22,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:50:22,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:50:22,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:50:22,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:50:22,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:50:22,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:50:22,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:50:22,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:50:22,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:50:22,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:50:22,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:50:22,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:50:22,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:50:22,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:50:22,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:50:22,194 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:50:22,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:50:22,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:50:22,225 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:50:22,226 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:50:22,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:50:22,229 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:50:22,229 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:50:22,229 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:50:22,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:50:22,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:50:22,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:50:22,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:50:22,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:50:22,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:50:22,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:50:22,232 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:50:22,237 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:50:22,237 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:50:22,284 INFO ]: Repository-Root is: /tmp [2018-06-26 17:50:22,298 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:50:22,304 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:50:22,305 INFO ]: Initializing SmtParser... [2018-06-26 17:50:22,306 INFO ]: SmtParser initialized [2018-06-26 17:50:22,306 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 [2018-06-26 17:50:22,308 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:50:22,450 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 unknown [2018-06-26 17:50:22,613 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/fib_merged_safe.c-1.smt2 [2018-06-26 17:50:22,618 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:50:22,626 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:50:22,627 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:50:22,627 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:50:22,627 INFO ]: ChcToBoogie initialized [2018-06-26 17:50:22,630 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,682 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22 Unit [2018-06-26 17:50:22,683 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:50:22,683 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:50:22,683 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:50:22,683 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:50:22,704 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,705 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,710 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,710 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,713 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,715 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,715 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,718 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:50:22,718 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:50:22,719 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:50:22,719 INFO ]: RCFGBuilder initialized [2018-06-26 17:50:22,719 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:50:22,734 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:50:22,734 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:50:22,734 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:50:22,734 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:50:22,734 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:50:22,734 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:50:22,936 INFO ]: Using library mode [2018-06-26 17:50:22,936 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:50:22 BoogieIcfgContainer [2018-06-26 17:50:22,936 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:50:22,937 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:50:22,937 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:50:22,947 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:50:22,948 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:50:22" (1/1) ... [2018-06-26 17:50:22,970 INFO ]: Initial Icfg 11 locations, 11 edges [2018-06-26 17:50:22,971 INFO ]: Using Remove infeasible edges [2018-06-26 17:50:22,972 INFO ]: Using Maximize final states [2018-06-26 17:50:22,972 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:50:22,972 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:50:22,974 INFO ]: Using Remove sink states [2018-06-26 17:50:22,975 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:50:22,975 INFO ]: Using Use SBE [2018-06-26 17:50:22,982 INFO ]: SBE split 0 edges [2018-06-26 17:50:22,999 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:50:23,001 INFO ]: 0 new accepting states [2018-06-26 17:50:23,049 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-26 17:50:23,051 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:50:23,056 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:50:23,056 INFO ]: 0 new accepting states [2018-06-26 17:50:23,056 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:50:23,057 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:50:23,057 INFO ]: Encoded RCFG 6 locations, 6 edges [2018-06-26 17:50:23,057 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:50:23 BasicIcfg [2018-06-26 17:50:23,057 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:50:23,058 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:50:23,058 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:50:23,061 INFO ]: TraceAbstraction initialized [2018-06-26 17:50:23,062 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:50:22" (1/4) ... [2018-06-26 17:50:23,062 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1239eba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:50:23, skipping insertion in model container [2018-06-26 17:50:23,063 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:50:22" (2/4) ... [2018-06-26 17:50:23,063 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1239eba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:50:23, skipping insertion in model container [2018-06-26 17:50:23,063 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:50:22" (3/4) ... [2018-06-26 17:50:23,063 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1239eba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:50:23, skipping insertion in model container [2018-06-26 17:50:23,063 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:50:23" (4/4) ... [2018-06-26 17:50:23,067 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:50:23,077 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:50:23,086 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:50:23,136 INFO ]: Using default assertion order modulation [2018-06-26 17:50:23,136 INFO ]: Interprodecural is true [2018-06-26 17:50:23,136 INFO ]: Hoare is false [2018-06-26 17:50:23,136 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:50:23,136 INFO ]: Backedges is TWOTRACK [2018-06-26 17:50:23,136 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:50:23,136 INFO ]: Difference is false [2018-06-26 17:50:23,136 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:50:23,137 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:50:23,154 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 17:50:23,168 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:50:23,168 INFO ]: Found error trace [2018-06-26 17:50:23,169 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:50:23,169 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:23,173 INFO ]: Analyzing trace with hash 36388580, now seen corresponding path program 1 times [2018-06-26 17:50:23,174 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:23,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:23,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:23,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,250 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:23,340 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:23,341 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:50:23,341 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:50:23,342 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:50:23,353 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:50:23,353 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:50:23,355 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 17:50:23,404 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:23,404 INFO ]: Finished difference Result 7 states and 7 transitions. [2018-06-26 17:50:23,404 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:50:23,406 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:50:23,406 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:23,413 INFO ]: With dead ends: 7 [2018-06-26 17:50:23,413 INFO ]: Without dead ends: 7 [2018-06-26 17:50:23,415 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:50:23,427 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:50:23,439 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:50:23,440 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:50:23,440 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-06-26 17:50:23,441 INFO ]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-06-26 17:50:23,442 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:23,442 INFO ]: Abstraction has 7 states and 7 transitions. [2018-06-26 17:50:23,442 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:50:23,442 INFO ]: Start isEmpty. Operand 7 states and 7 transitions. [2018-06-26 17:50:23,442 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:50:23,442 INFO ]: Found error trace [2018-06-26 17:50:23,442 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:50:23,442 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:23,442 INFO ]: Analyzing trace with hash 1128020193, now seen corresponding path program 1 times [2018-06-26 17:50:23,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:23,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:23,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:23,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,469 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:23,609 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:23,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:23,609 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:50:23,624 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:23,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:23,682 INFO ]: Computing forward predicates... [2018-06-26 17:50:23,748 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:23,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:23,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 17:50:23,778 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:50:23,778 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:50:23,778 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:50:23,778 INFO ]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-06-26 17:50:23,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:23,845 INFO ]: Finished difference Result 8 states and 8 transitions. [2018-06-26 17:50:23,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:50:23,845 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:50:23,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:23,845 INFO ]: With dead ends: 8 [2018-06-26 17:50:23,845 INFO ]: Without dead ends: 8 [2018-06-26 17:50:23,846 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:50:23,846 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:50:23,847 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:50:23,847 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:50:23,848 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 17:50:23,848 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-26 17:50:23,848 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:23,848 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 17:50:23,848 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:50:23,848 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 17:50:23,848 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:50:23,848 INFO ]: Found error trace [2018-06-26 17:50:23,848 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 17:50:23,848 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:23,848 INFO ]: Analyzing trace with hash 608861828, now seen corresponding path program 2 times [2018-06-26 17:50:23,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:23,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:23,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:23,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:23,888 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:24,011 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:24,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:24,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:24,021 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:50:24,094 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:50:24,094 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:24,097 INFO ]: Computing forward predicates... [2018-06-26 17:50:24,168 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:24,199 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:24,199 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:50:24,199 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:50:24,199 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:50:24,199 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:50:24,200 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-06-26 17:50:24,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:24,380 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-26 17:50:24,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:50:24,381 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-26 17:50:24,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:24,381 INFO ]: With dead ends: 9 [2018-06-26 17:50:24,381 INFO ]: Without dead ends: 9 [2018-06-26 17:50:24,382 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:50:24,382 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:50:24,383 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:50:24,383 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:50:24,383 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-26 17:50:24,383 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-26 17:50:24,383 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:24,383 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-26 17:50:24,383 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:50:24,383 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-26 17:50:24,383 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:50:24,383 INFO ]: Found error trace [2018-06-26 17:50:24,383 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 17:50:24,384 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:24,384 INFO ]: Analyzing trace with hash 1694821697, now seen corresponding path program 3 times [2018-06-26 17:50:24,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:24,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:24,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:24,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:24,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:24,431 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:24,722 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:24,722 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:24,722 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:24,728 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:50:24,779 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:50:24,779 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:24,783 INFO ]: Computing forward predicates... [2018-06-26 17:50:24,843 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:24,877 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:24,877 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 17:50:24,878 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:50:24,878 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:50:24,878 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:50:24,878 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-06-26 17:50:24,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:24,952 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 17:50:24,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:50:24,953 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-26 17:50:24,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:24,953 INFO ]: With dead ends: 10 [2018-06-26 17:50:24,953 INFO ]: Without dead ends: 10 [2018-06-26 17:50:24,954 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:50:24,954 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:50:24,955 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:50:24,955 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:50:24,955 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 17:50:24,955 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-26 17:50:24,955 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:24,955 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 17:50:24,955 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:50:24,955 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 17:50:24,956 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:50:24,956 INFO ]: Found error trace [2018-06-26 17:50:24,956 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 17:50:24,956 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:24,956 INFO ]: Analyzing trace with hash 999839268, now seen corresponding path program 4 times [2018-06-26 17:50:24,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:24,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:24,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:24,956 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:24,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:25,002 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:25,733 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:25,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:25,733 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:25,750 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:50:25,790 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:50:25,790 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:25,794 INFO ]: Computing forward predicates... [2018-06-26 17:50:25,825 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:25,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:25,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:50:25,852 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:50:25,852 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:50:25,852 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:50:25,853 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-26 17:50:25,944 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:25,944 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 17:50:25,944 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:50:25,944 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 17:50:25,944 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:25,944 INFO ]: With dead ends: 11 [2018-06-26 17:50:25,944 INFO ]: Without dead ends: 11 [2018-06-26 17:50:25,945 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:50:25,945 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:50:25,946 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:50:25,946 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:50:25,946 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 17:50:25,946 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 17:50:25,947 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:25,947 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 17:50:25,947 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:50:25,947 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 17:50:25,947 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:50:25,947 INFO ]: Found error trace [2018-06-26 17:50:25,947 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 17:50:25,947 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:25,947 INFO ]: Analyzing trace with hash 930220449, now seen corresponding path program 5 times [2018-06-26 17:50:25,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:25,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:25,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:25,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:25,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:25,970 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:26,109 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:26,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:26,109 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:26,128 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:50:26,219 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:50:26,219 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:26,227 INFO ]: Computing forward predicates... [2018-06-26 17:50:26,295 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:26,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:26,325 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:50:26,325 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:50:26,325 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:50:26,326 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:50:26,326 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-26 17:50:26,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:26,897 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 17:50:26,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:50:26,899 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-26 17:50:26,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:26,900 INFO ]: With dead ends: 12 [2018-06-26 17:50:26,900 INFO ]: Without dead ends: 12 [2018-06-26 17:50:26,900 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:50:26,900 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:50:26,901 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:50:26,901 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:50:26,901 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 17:50:26,902 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 17:50:26,902 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:26,902 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 17:50:26,902 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:50:26,902 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 17:50:26,904 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:50:26,904 INFO ]: Found error trace [2018-06-26 17:50:26,904 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 17:50:26,904 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:26,905 INFO ]: Analyzing trace with hash -1227962940, now seen corresponding path program 6 times [2018-06-26 17:50:26,905 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:26,905 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:26,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:26,905 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:26,905 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:26,937 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:27,310 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:27,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:27,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:27,331 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:50:27,388 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:50:27,388 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:27,394 INFO ]: Computing forward predicates... [2018-06-26 17:50:27,419 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:27,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:27,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:50:27,451 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:50:27,452 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:50:27,452 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:50:27,452 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-06-26 17:50:27,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:27,616 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 17:50:27,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:50:27,617 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 17:50:27,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:27,617 INFO ]: With dead ends: 13 [2018-06-26 17:50:27,617 INFO ]: Without dead ends: 13 [2018-06-26 17:50:27,617 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:50:27,617 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:50:27,618 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:50:27,619 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:50:27,619 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 17:50:27,619 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 17:50:27,619 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:27,619 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 17:50:27,619 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:50:27,619 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 17:50:27,619 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:50:27,619 INFO ]: Found error trace [2018-06-26 17:50:27,619 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 17:50:27,620 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:27,620 INFO ]: Analyzing trace with hash 587828737, now seen corresponding path program 7 times [2018-06-26 17:50:27,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:27,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:27,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:27,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:27,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:27,650 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:27,904 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:27,904 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:27,904 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:27,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:27,965 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:27,971 INFO ]: Computing forward predicates... [2018-06-26 17:50:27,994 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:28,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:28,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:50:28,027 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:50:28,027 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:50:28,027 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:50:28,027 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-06-26 17:50:28,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:28,289 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 17:50:28,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:50:28,290 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-26 17:50:28,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:28,290 INFO ]: With dead ends: 14 [2018-06-26 17:50:28,290 INFO ]: Without dead ends: 14 [2018-06-26 17:50:28,290 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:50:28,291 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:50:28,292 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:50:28,292 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:50:28,292 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 17:50:28,292 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 17:50:28,292 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:28,292 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 17:50:28,292 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:50:28,292 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 17:50:28,293 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:50:28,293 INFO ]: Found error trace [2018-06-26 17:50:28,293 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 17:50:28,293 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:28,293 INFO ]: Analyzing trace with hash 1042795876, now seen corresponding path program 8 times [2018-06-26 17:50:28,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:28,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:28,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:28,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:28,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:28,339 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:28,693 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:28,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:28,693 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:28,699 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:50:28,763 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:50:28,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:28,771 INFO ]: Computing forward predicates... [2018-06-26 17:50:28,848 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:28,880 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:28,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:50:28,880 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:50:28,881 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:50:28,881 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:50:28,881 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-06-26 17:50:28,985 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:28,985 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:50:28,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:50:28,986 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 17:50:28,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:28,986 INFO ]: With dead ends: 15 [2018-06-26 17:50:28,986 INFO ]: Without dead ends: 15 [2018-06-26 17:50:28,987 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:50:28,987 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:50:28,987 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:50:28,988 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:50:28,988 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 17:50:28,988 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 17:50:28,988 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:28,988 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 17:50:28,988 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:50:28,988 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 17:50:28,988 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:50:28,988 INFO ]: Found error trace [2018-06-26 17:50:28,988 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 17:50:28,989 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:28,989 INFO ]: Analyzing trace with hash -2033091999, now seen corresponding path program 9 times [2018-06-26 17:50:28,989 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:28,989 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:28,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:28,989 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:28,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:29,036 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:29,364 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:29,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:29,364 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:29,370 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:50:29,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:50:29,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:29,450 INFO ]: Computing forward predicates... [2018-06-26 17:50:29,472 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:29,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:29,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:50:29,504 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:50:29,504 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:50:29,505 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:50:29,505 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-06-26 17:50:29,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:29,614 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 17:50:29,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:50:29,614 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 17:50:29,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:29,614 INFO ]: With dead ends: 16 [2018-06-26 17:50:29,614 INFO ]: Without dead ends: 16 [2018-06-26 17:50:29,615 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:50:29,615 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:50:29,616 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:50:29,616 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:50:29,617 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 17:50:29,617 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 17:50:29,617 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:29,617 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 17:50:29,617 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:50:29,617 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 17:50:29,617 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:50:29,617 INFO ]: Found error trace [2018-06-26 17:50:29,617 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 17:50:29,617 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:29,617 INFO ]: Analyzing trace with hash 1398631684, now seen corresponding path program 10 times [2018-06-26 17:50:29,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:29,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:29,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:29,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:29,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:29,663 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:30,008 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:30,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:30,008 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 17:50:30,014 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:50:30,084 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:50:30,084 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:30,095 INFO ]: Computing forward predicates... [2018-06-26 17:50:30,156 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:30,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:30,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:50:30,189 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:50:30,189 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:50:30,189 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:50:30,189 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-06-26 17:50:30,483 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:30,483 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 17:50:30,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:50:30,484 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-26 17:50:30,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:30,484 INFO ]: With dead ends: 17 [2018-06-26 17:50:30,484 INFO ]: Without dead ends: 17 [2018-06-26 17:50:30,484 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:50:30,484 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:50:30,486 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:50:30,486 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:50:30,486 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 17:50:30,486 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 17:50:30,487 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:30,487 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 17:50:30,487 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:50:30,487 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 17:50:30,487 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:50:30,487 INFO ]: Found error trace [2018-06-26 17:50:30,487 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 17:50:30,487 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:30,487 INFO ]: Analyzing trace with hash 407883457, now seen corresponding path program 11 times [2018-06-26 17:50:30,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:30,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:30,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:30,488 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:30,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:30,546 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:30,940 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:30,940 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:30,940 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:50:30,955 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:31,023 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:50:31,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:31,033 INFO ]: Computing forward predicates... [2018-06-26 17:50:31,059 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:31,092 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:31,093 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 17:50:31,093 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:50:31,093 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:50:31,093 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:50:31,093 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-06-26 17:50:31,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:31,246 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 17:50:31,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:50:31,246 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-26 17:50:31,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:31,247 INFO ]: With dead ends: 18 [2018-06-26 17:50:31,247 INFO ]: Without dead ends: 18 [2018-06-26 17:50:31,247 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:50:31,247 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:50:31,248 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:50:31,248 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:50:31,249 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 17:50:31,249 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 17:50:31,249 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:31,249 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 17:50:31,249 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:50:31,249 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 17:50:31,249 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:50:31,249 INFO ]: Found error trace [2018-06-26 17:50:31,249 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-26 17:50:31,249 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:31,249 INFO ]: Analyzing trace with hash -240540508, now seen corresponding path program 12 times [2018-06-26 17:50:31,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:31,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:31,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:31,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:31,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:31,335 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:31,621 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:31,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:31,621 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:31,628 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:50:31,696 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:50:31,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:31,705 INFO ]: Computing forward predicates... [2018-06-26 17:50:31,732 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:31,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:31,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:50:31,765 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:50:31,765 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:50:31,765 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:50:31,765 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-06-26 17:50:32,585 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:32,585 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 17:50:32,585 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:50:32,585 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-26 17:50:32,586 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:32,586 INFO ]: With dead ends: 19 [2018-06-26 17:50:32,586 INFO ]: Without dead ends: 19 [2018-06-26 17:50:32,586 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:50:32,586 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:50:32,588 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:50:32,588 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:50:32,588 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 17:50:32,588 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 17:50:32,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:32,588 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 17:50:32,588 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:50:32,588 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 17:50:32,589 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:50:32,589 INFO ]: Found error trace [2018-06-26 17:50:32,589 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-26 17:50:32,589 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:32,589 INFO ]: Analyzing trace with hash 1133153057, now seen corresponding path program 13 times [2018-06-26 17:50:32,589 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:32,589 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:32,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:32,590 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:32,590 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:32,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:33,067 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:33,067 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:33,067 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:33,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:33,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:33,171 INFO ]: Computing forward predicates... [2018-06-26 17:50:33,218 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:33,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:33,250 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 17:50:33,251 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:50:33,251 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:50:33,251 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:50:33,251 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-06-26 17:50:33,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:33,659 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 17:50:33,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:50:33,660 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-26 17:50:33,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:33,660 INFO ]: With dead ends: 20 [2018-06-26 17:50:33,660 INFO ]: Without dead ends: 20 [2018-06-26 17:50:33,661 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:50:33,661 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:50:33,662 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:50:33,662 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:50:33,663 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 17:50:33,663 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 17:50:33,663 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:33,663 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 17:50:33,663 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:50:33,663 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 17:50:33,663 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:50:33,663 INFO ]: Found error trace [2018-06-26 17:50:33,663 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-26 17:50:33,663 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:33,663 INFO ]: Analyzing trace with hash 767980612, now seen corresponding path program 14 times [2018-06-26 17:50:33,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:33,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:33,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:33,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:33,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:33,783 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:34,840 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:34,840 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:34,840 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:34,846 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:50:34,947 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:50:34,947 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:34,959 INFO ]: Computing forward predicates... [2018-06-26 17:50:35,030 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:35,056 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:35,057 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 17:50:35,057 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:50:35,057 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:50:35,057 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:50:35,057 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-06-26 17:50:35,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:35,410 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 17:50:35,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:50:35,410 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-26 17:50:35,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:35,411 INFO ]: With dead ends: 21 [2018-06-26 17:50:35,411 INFO ]: Without dead ends: 21 [2018-06-26 17:50:35,412 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:50:35,412 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:50:35,413 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:50:35,413 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:50:35,414 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 17:50:35,414 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 17:50:35,414 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:35,414 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 17:50:35,414 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:50:35,414 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 17:50:35,414 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:50:35,414 INFO ]: Found error trace [2018-06-26 17:50:35,414 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-26 17:50:35,414 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:35,415 INFO ]: Analyzing trace with hash -1962430591, now seen corresponding path program 15 times [2018-06-26 17:50:35,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:35,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:35,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:35,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:35,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:35,551 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:36,307 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:36,307 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:36,307 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:36,312 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:50:36,487 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:50:36,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:36,497 INFO ]: Computing forward predicates... [2018-06-26 17:50:36,541 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:36,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:36,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 17:50:36,568 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:50:36,568 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:50:36,568 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:50:36,568 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-06-26 17:50:36,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:36,738 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 17:50:36,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:50:36,738 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-26 17:50:36,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:36,738 INFO ]: With dead ends: 22 [2018-06-26 17:50:36,738 INFO ]: Without dead ends: 22 [2018-06-26 17:50:36,739 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:50:36,739 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:50:36,740 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:50:36,740 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:50:36,741 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 17:50:36,741 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 17:50:36,741 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:36,741 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 17:50:36,741 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:50:36,741 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 17:50:36,741 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:50:36,741 INFO ]: Found error trace [2018-06-26 17:50:36,741 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-26 17:50:36,741 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:36,741 INFO ]: Analyzing trace with hash -705831964, now seen corresponding path program 16 times [2018-06-26 17:50:36,741 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:36,741 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:36,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:36,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:36,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:36,895 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:37,265 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:37,265 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:37,265 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:37,272 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:50:37,351 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:50:37,351 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:37,367 INFO ]: Computing forward predicates... [2018-06-26 17:50:37,402 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:37,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:37,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 17:50:37,435 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:50:37,435 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:50:37,435 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:50:37,435 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-06-26 17:50:37,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:37,720 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 17:50:37,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:50:37,720 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-26 17:50:37,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:37,720 INFO ]: With dead ends: 23 [2018-06-26 17:50:37,720 INFO ]: Without dead ends: 23 [2018-06-26 17:50:37,721 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:50:37,721 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:50:37,722 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:50:37,722 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:50:37,723 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 17:50:37,723 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 17:50:37,723 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:37,723 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 17:50:37,723 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:50:37,723 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 17:50:37,723 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:50:37,723 INFO ]: Found error trace [2018-06-26 17:50:37,723 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-26 17:50:37,724 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:37,724 INFO ]: Analyzing trace with hash -405980191, now seen corresponding path program 17 times [2018-06-26 17:50:37,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:37,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:37,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:37,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:37,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:37,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:38,231 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:38,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:38,232 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:38,237 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:50:38,349 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:50:38,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:38,365 INFO ]: Computing forward predicates... [2018-06-26 17:50:38,392 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:38,425 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:38,425 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-26 17:50:38,426 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:50:38,426 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:50:38,426 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:50:38,429 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-06-26 17:50:38,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:38,729 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 17:50:38,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:50:38,730 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-26 17:50:38,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:38,730 INFO ]: With dead ends: 24 [2018-06-26 17:50:38,730 INFO ]: Without dead ends: 24 [2018-06-26 17:50:38,731 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:50:38,731 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:50:38,734 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:50:38,734 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:50:38,734 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 17:50:38,734 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 17:50:38,734 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:38,734 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 17:50:38,734 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:50:38,734 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 17:50:38,735 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:50:38,735 INFO ]: Found error trace [2018-06-26 17:50:38,735 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-26 17:50:38,735 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:38,735 INFO ]: Analyzing trace with hash 299490180, now seen corresponding path program 18 times [2018-06-26 17:50:38,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:38,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:38,735 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:38,735 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:38,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:38,911 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:39,380 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:39,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:39,380 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:39,386 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:50:39,482 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 17:50:39,482 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:39,495 INFO ]: Computing forward predicates... [2018-06-26 17:50:39,523 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:39,555 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:39,555 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 17:50:39,555 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:50:39,555 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:50:39,555 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:50:39,556 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-06-26 17:50:40,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:40,358 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 17:50:40,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:50:40,358 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-26 17:50:40,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:40,359 INFO ]: With dead ends: 25 [2018-06-26 17:50:40,359 INFO ]: Without dead ends: 25 [2018-06-26 17:50:40,359 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:50:40,359 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:50:40,361 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:50:40,361 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:50:40,361 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 17:50:40,361 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 17:50:40,361 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:40,361 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 17:50:40,361 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:50:40,361 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 17:50:40,361 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:50:40,361 INFO ]: Found error trace [2018-06-26 17:50:40,361 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-26 17:50:40,361 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:40,362 INFO ]: Analyzing trace with hash 694235201, now seen corresponding path program 19 times [2018-06-26 17:50:40,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:40,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:40,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:40,362 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:40,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:40,633 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:41,115 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:41,115 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:41,115 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:41,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:41,260 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:41,287 INFO ]: Computing forward predicates... [2018-06-26 17:50:41,333 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:41,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:41,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-26 17:50:41,353 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:50:41,353 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:50:41,353 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:50:41,353 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-06-26 17:50:41,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:41,641 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 17:50:41,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:50:41,641 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-26 17:50:41,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:41,642 INFO ]: With dead ends: 26 [2018-06-26 17:50:41,642 INFO ]: Without dead ends: 26 [2018-06-26 17:50:41,642 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:50:41,642 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:50:41,644 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:50:41,644 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:50:41,644 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 17:50:41,644 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 17:50:41,644 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:41,644 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 17:50:41,644 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:50:41,644 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 17:50:41,645 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:50:41,645 INFO ]: Found error trace [2018-06-26 17:50:41,645 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-26 17:50:41,645 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:41,645 INFO ]: Analyzing trace with hash 46428964, now seen corresponding path program 20 times [2018-06-26 17:50:41,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:41,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:41,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:41,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:41,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:41,848 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:42,433 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:42,433 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:42,433 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:42,443 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:50:42,555 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:50:42,555 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:42,584 INFO ]: Computing forward predicates... [2018-06-26 17:50:42,612 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:42,634 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:42,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-26 17:50:42,635 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:50:42,635 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:50:42,635 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:50:42,635 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-06-26 17:50:43,039 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:43,039 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 17:50:43,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:50:43,039 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-26 17:50:43,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:43,039 INFO ]: With dead ends: 27 [2018-06-26 17:50:43,039 INFO ]: Without dead ends: 27 [2018-06-26 17:50:43,040 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:50:43,040 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:50:43,041 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:50:43,041 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:50:43,042 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 17:50:43,042 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 17:50:43,042 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:43,042 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 17:50:43,042 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:50:43,042 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 17:50:43,042 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:50:43,042 INFO ]: Found error trace [2018-06-26 17:50:43,042 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-26 17:50:43,043 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:43,043 INFO ]: Analyzing trace with hash 1439272097, now seen corresponding path program 21 times [2018-06-26 17:50:43,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:43,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:43,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:43,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:43,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:43,267 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:44,422 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:44,422 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:44,452 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:44,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:50:44,604 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 17:50:44,604 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:44,622 INFO ]: Computing forward predicates... [2018-06-26 17:50:44,667 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:44,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:44,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-26 17:50:44,700 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:50:44,700 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:50:44,700 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:50:44,700 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-06-26 17:50:45,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:45,104 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 17:50:45,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:50:45,105 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-26 17:50:45,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:45,105 INFO ]: With dead ends: 28 [2018-06-26 17:50:45,105 INFO ]: Without dead ends: 28 [2018-06-26 17:50:45,105 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:50:45,106 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:50:45,107 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:50:45,107 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:50:45,107 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 17:50:45,107 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 17:50:45,108 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:45,108 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 17:50:45,108 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:50:45,108 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 17:50:45,108 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:50:45,108 INFO ]: Found error trace [2018-06-26 17:50:45,108 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-26 17:50:45,108 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:45,108 INFO ]: Analyzing trace with hash 1667736260, now seen corresponding path program 22 times [2018-06-26 17:50:45,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:45,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:45,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:45,109 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:45,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:45,379 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:46,241 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:46,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:46,241 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:46,247 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:50:46,415 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:50:46,415 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:46,477 INFO ]: Computing forward predicates... [2018-06-26 17:50:46,522 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:46,544 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:46,544 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-26 17:50:46,544 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:50:46,544 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:50:46,544 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:50:46,544 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-06-26 17:50:47,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:47,221 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 17:50:47,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:50:47,223 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-26 17:50:47,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:47,223 INFO ]: With dead ends: 29 [2018-06-26 17:50:47,223 INFO ]: Without dead ends: 29 [2018-06-26 17:50:47,223 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:50:47,223 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:50:47,225 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:50:47,225 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:50:47,225 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:50:47,225 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 17:50:47,225 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:47,225 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:50:47,225 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:50:47,225 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:50:47,226 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:50:47,226 INFO ]: Found error trace [2018-06-26 17:50:47,226 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-26 17:50:47,226 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:47,226 INFO ]: Analyzing trace with hash 160190721, now seen corresponding path program 23 times [2018-06-26 17:50:47,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:47,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:47,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:47,227 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:47,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:47,584 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:48,289 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:48,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:48,289 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:48,294 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:50:48,544 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 17:50:48,544 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:48,577 INFO ]: Computing forward predicates... [2018-06-26 17:50:48,608 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:48,627 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:48,627 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-26 17:50:48,627 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:50:48,628 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:50:48,628 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:50:48,628 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-06-26 17:50:49,174 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:49,174 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 17:50:49,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:50:49,174 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-26 17:50:49,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:49,174 INFO ]: With dead ends: 30 [2018-06-26 17:50:49,174 INFO ]: Without dead ends: 30 [2018-06-26 17:50:49,175 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:50:49,175 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:50:49,177 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:50:49,177 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:50:49,177 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 17:50:49,177 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 17:50:49,177 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:49,177 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 17:50:49,177 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:50:49,177 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 17:50:49,178 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:50:49,178 INFO ]: Found error trace [2018-06-26 17:50:49,178 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-26 17:50:49,178 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:49,178 INFO ]: Analyzing trace with hash 670919268, now seen corresponding path program 24 times [2018-06-26 17:50:49,178 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:49,178 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:49,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:49,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:49,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:49,681 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:50,382 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:50,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:50,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:50,388 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:50:50,532 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 17:50:50,532 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:50,549 INFO ]: Computing forward predicates... [2018-06-26 17:50:50,583 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:50,612 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:50,612 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-26 17:50:50,612 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:50:50,612 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:50:50,612 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:50:50,613 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-06-26 17:50:51,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:51,097 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 17:50:51,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:50:51,097 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-26 17:50:51,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:51,097 INFO ]: With dead ends: 31 [2018-06-26 17:50:51,097 INFO ]: Without dead ends: 31 [2018-06-26 17:50:51,098 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:50:51,098 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:50:51,099 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:50:51,099 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:50:51,100 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 17:50:51,100 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 17:50:51,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:51,100 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 17:50:51,100 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:50:51,100 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 17:50:51,101 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:50:51,101 INFO ]: Found error trace [2018-06-26 17:50:51,101 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-26 17:50:51,101 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:51,101 INFO ]: Analyzing trace with hash -676364959, now seen corresponding path program 25 times [2018-06-26 17:50:51,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:51,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:51,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:51,102 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:51,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:51,519 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:52,595 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:52,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:52,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:52,601 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:52,850 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:52,978 INFO ]: Computing forward predicates... [2018-06-26 17:50:53,014 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:53,045 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:53,045 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-26 17:50:53,045 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:50:53,046 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:50:53,046 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:50:53,046 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-06-26 17:50:53,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:53,599 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 17:50:53,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:50:53,599 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-26 17:50:53,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:53,599 INFO ]: With dead ends: 32 [2018-06-26 17:50:53,599 INFO ]: Without dead ends: 32 [2018-06-26 17:50:53,600 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:50:53,600 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:50:53,602 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:50:53,602 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:50:53,602 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 17:50:53,603 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 17:50:53,603 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:53,603 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 17:50:53,603 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:50:53,603 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 17:50:53,603 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:50:53,603 INFO ]: Found error trace [2018-06-26 17:50:53,603 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-26 17:50:53,603 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:53,603 INFO ]: Analyzing trace with hash 507496964, now seen corresponding path program 26 times [2018-06-26 17:50:53,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:53,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:53,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:53,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:50:53,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:53,960 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:55,273 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:55,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:55,273 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:55,285 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:50:55,541 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:50:55,541 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:55,677 INFO ]: Computing forward predicates... [2018-06-26 17:50:55,712 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:55,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:55,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-26 17:50:55,731 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:50:55,731 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:50:55,732 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:50:55,732 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-06-26 17:50:56,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:56,425 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 17:50:56,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:50:56,430 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-26 17:50:56,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:56,430 INFO ]: With dead ends: 33 [2018-06-26 17:50:56,430 INFO ]: Without dead ends: 33 [2018-06-26 17:50:56,431 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:50:56,431 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:50:56,433 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:50:56,433 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:50:56,433 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 17:50:56,433 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 17:50:56,433 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:56,433 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 17:50:56,433 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:50:56,433 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 17:50:56,434 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:50:56,434 INFO ]: Found error trace [2018-06-26 17:50:56,434 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-26 17:50:56,434 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:56,434 INFO ]: Analyzing trace with hash -1447489087, now seen corresponding path program 27 times [2018-06-26 17:50:56,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:56,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:56,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:56,435 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:56,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:56,950 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:57,609 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:57,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:57,609 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:57,615 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:50:57,832 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 17:50:57,832 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:57,862 INFO ]: Computing forward predicates... [2018-06-26 17:50:57,926 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:57,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:50:57,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-26 17:50:57,958 INFO ]: Interpolant automaton has 30 states [2018-06-26 17:50:57,958 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 17:50:57,958 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:50:57,959 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-06-26 17:50:58,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:50:58,537 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 17:50:58,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:50:58,539 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-26 17:50:58,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:50:58,539 INFO ]: With dead ends: 34 [2018-06-26 17:50:58,539 INFO ]: Without dead ends: 34 [2018-06-26 17:50:58,539 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:50:58,539 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:50:58,541 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:50:58,541 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:50:58,541 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 17:50:58,541 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 17:50:58,542 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:50:58,542 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 17:50:58,542 INFO ]: Interpolant automaton has 30 states. [2018-06-26 17:50:58,542 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 17:50:58,542 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:50:58,542 INFO ]: Found error trace [2018-06-26 17:50:58,542 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-26 17:50:58,542 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:50:58,542 INFO ]: Analyzing trace with hash -1922514524, now seen corresponding path program 28 times [2018-06-26 17:50:58,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:50:58,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:50:58,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:58,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:50:58,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:50:59,121 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:50:59,821 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:50:59,821 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:50:59,821 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:50:59,826 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:51:00,235 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:51:00,235 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:00,491 INFO ]: Computing forward predicates... [2018-06-26 17:51:00,534 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:00,567 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:00,567 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-26 17:51:00,567 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:51:00,567 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:51:00,567 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:51:00,568 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-06-26 17:51:01,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:01,197 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 17:51:01,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:51:01,197 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-26 17:51:01,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:01,197 INFO ]: With dead ends: 35 [2018-06-26 17:51:01,197 INFO ]: Without dead ends: 35 [2018-06-26 17:51:01,197 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:51:01,198 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:51:01,199 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:51:01,199 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:51:01,199 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 17:51:01,199 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 17:51:01,200 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:01,200 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 17:51:01,200 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:51:01,200 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 17:51:01,200 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:51:01,200 INFO ]: Found error trace [2018-06-26 17:51:01,200 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-26 17:51:01,200 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:01,200 INFO ]: Analyzing trace with hash 531566113, now seen corresponding path program 29 times [2018-06-26 17:51:01,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:01,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:01,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:01,201 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:51:01,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:01,733 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:02,875 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:02,875 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:02,875 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:02,881 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:51:03,558 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 17:51:03,558 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:03,652 INFO ]: Computing forward predicates... [2018-06-26 17:51:03,702 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:03,722 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:03,722 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-26 17:51:03,722 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:51:03,722 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:51:03,723 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:51:03,723 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-06-26 17:51:04,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:04,434 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 17:51:04,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:51:04,434 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-26 17:51:04,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:04,434 INFO ]: With dead ends: 36 [2018-06-26 17:51:04,434 INFO ]: Without dead ends: 36 [2018-06-26 17:51:04,435 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:51:04,435 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:51:04,436 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:51:04,436 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:51:04,436 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 17:51:04,436 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 17:51:04,437 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:04,437 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 17:51:04,437 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:51:04,437 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 17:51:04,437 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:51:04,437 INFO ]: Found error trace [2018-06-26 17:51:04,437 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-26 17:51:04,437 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:04,437 INFO ]: Analyzing trace with hash -701345468, now seen corresponding path program 30 times [2018-06-26 17:51:04,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:04,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:04,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:04,438 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:51:04,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:05,097 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:06,603 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:06,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:06,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:06,608 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:51:06,797 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-26 17:51:06,797 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:06,821 INFO ]: Computing forward predicates... [2018-06-26 17:51:06,918 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:06,937 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:06,937 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-26 17:51:06,937 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:51:06,938 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:51:06,938 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:51:06,938 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-06-26 17:51:07,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:07,799 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 17:51:07,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:51:07,799 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-26 17:51:07,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:07,800 INFO ]: With dead ends: 37 [2018-06-26 17:51:07,800 INFO ]: Without dead ends: 37 [2018-06-26 17:51:07,800 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:51:07,800 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:51:07,801 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:51:07,801 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:51:07,801 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 17:51:07,801 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 17:51:07,802 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:07,802 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 17:51:07,802 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:51:07,802 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 17:51:07,802 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:51:07,802 INFO ]: Found error trace [2018-06-26 17:51:07,802 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-26 17:51:07,802 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:07,802 INFO ]: Analyzing trace with hash -266898815, now seen corresponding path program 31 times [2018-06-26 17:51:07,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:07,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:07,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:07,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:51:07,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:08,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:09,414 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:09,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:09,414 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:09,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:51:10,047 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:10,482 INFO ]: Computing forward predicates... [2018-06-26 17:51:10,510 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:10,530 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:10,530 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-26 17:51:10,530 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:51:10,530 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:51:10,530 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:51:10,530 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-06-26 17:51:11,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:11,419 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 17:51:11,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:51:11,419 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-26 17:51:11,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:11,419 INFO ]: With dead ends: 38 [2018-06-26 17:51:11,419 INFO ]: Without dead ends: 38 [2018-06-26 17:51:11,419 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:51:11,420 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:51:11,421 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:51:11,421 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:51:11,421 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 17:51:11,421 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 17:51:11,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:11,421 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 17:51:11,421 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:51:11,421 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 17:51:11,422 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:51:11,422 INFO ]: Found error trace [2018-06-26 17:51:11,422 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-26 17:51:11,422 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:11,422 INFO ]: Analyzing trace with hash 316045540, now seen corresponding path program 32 times [2018-06-26 17:51:11,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:11,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:11,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:11,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:51:11,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:12,319 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:13,144 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:13,144 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:13,144 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:13,150 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:51:13,782 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:51:13,782 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:14,226 INFO ]: Computing forward predicates... [2018-06-26 17:51:14,333 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:14,367 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:14,367 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-26 17:51:14,367 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:51:14,368 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:51:14,368 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:51:14,368 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-06-26 17:51:15,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:15,667 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 17:51:15,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:51:15,667 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-26 17:51:15,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:15,668 INFO ]: With dead ends: 39 [2018-06-26 17:51:15,668 INFO ]: Without dead ends: 39 [2018-06-26 17:51:15,668 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:51:15,668 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:51:15,669 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:51:15,669 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:51:15,670 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 17:51:15,670 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 17:51:15,670 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:15,670 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 17:51:15,670 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:51:15,670 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 17:51:15,670 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:51:15,670 INFO ]: Found error trace [2018-06-26 17:51:15,670 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-26 17:51:15,670 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:15,670 INFO ]: Analyzing trace with hash 1207451361, now seen corresponding path program 33 times [2018-06-26 17:51:15,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:15,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:15,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:15,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:51:15,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:16,498 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:17,670 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:17,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:17,670 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:17,675 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:51:17,980 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 17:51:17,980 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:18,033 INFO ]: Computing forward predicates... [2018-06-26 17:51:18,074 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:18,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:51:18,098 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-26 17:51:18,098 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:51:18,098 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:51:18,098 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:51:18,099 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-06-26 17:51:19,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:51:19,069 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 17:51:19,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:51:19,070 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-26 17:51:19,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:51:19,070 INFO ]: With dead ends: 40 [2018-06-26 17:51:19,070 INFO ]: Without dead ends: 40 [2018-06-26 17:51:19,070 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:51:19,070 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:51:19,072 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:51:19,072 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:51:19,072 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 17:51:19,072 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 17:51:19,072 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:51:19,072 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 17:51:19,072 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:51:19,072 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 17:51:19,073 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:51:19,073 INFO ]: Found error trace [2018-06-26 17:51:19,073 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-26 17:51:19,073 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:51:19,073 INFO ]: Analyzing trace with hash -1223739260, now seen corresponding path program 34 times [2018-06-26 17:51:19,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:51:19,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:51:19,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:19,073 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:51:19,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:51:19,968 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:21,659 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:51:21,659 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:51:21,659 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:21,667 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Received shutdown request... [2018-06-26 17:51:22,566 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:51:22,566 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:51:23,218 INFO ]: Computing forward predicates... [2018-06-26 17:51:23,219 INFO ]: Timeout while computing interpolants [2018-06-26 17:51:23,420 WARN ]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:51:23,420 WARN ]: Verification canceled [2018-06-26 17:51:23,421 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:51:23,422 WARN ]: Timeout [2018-06-26 17:51:23,423 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:51:23 BasicIcfg [2018-06-26 17:51:23,423 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:51:23,423 INFO ]: Toolchain (without parser) took 60805.14 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 921.7 MB). Free memory was 265.1 MB in the beginning and 765.9 MB in the end (delta: -500.7 MB). Peak memory consumption was 421.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,424 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:51:23,425 INFO ]: ChcToBoogie took 56.05 ms. Allocated memory is still 308.8 MB. Free memory was 265.1 MB in the beginning and 263.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,425 INFO ]: Boogie Preprocessor took 34.87 ms. Allocated memory is still 308.8 MB. Free memory was 263.0 MB in the beginning and 262.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,425 INFO ]: RCFGBuilder took 217.98 ms. Allocated memory is still 308.8 MB. Free memory was 262.1 MB in the beginning and 254.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,426 INFO ]: BlockEncodingV2 took 120.55 ms. Allocated memory is still 308.8 MB. Free memory was 254.1 MB in the beginning and 250.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,426 INFO ]: TraceAbstraction took 60364.21 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 921.7 MB). Free memory was 250.0 MB in the beginning and 765.9 MB in the end (delta: -515.8 MB). Peak memory consumption was 405.9 MB. Max. memory is 3.6 GB. [2018-06-26 17:51:23,429 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 11 edges - StatisticsResult: Encoded RCFG 6 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.05 ms. Allocated memory is still 308.8 MB. Free memory was 265.1 MB in the beginning and 263.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.87 ms. Allocated memory is still 308.8 MB. Free memory was 263.0 MB in the beginning and 262.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 217.98 ms. Allocated memory is still 308.8 MB. Free memory was 262.1 MB in the beginning and 254.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 120.55 ms. Allocated memory is still 308.8 MB. Free memory was 254.1 MB in the beginning and 250.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 60364.21 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 921.7 MB). Free memory was 250.0 MB in the beginning and 765.9 MB in the end (delta: -515.8 MB). Peak memory consumption was 405.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 34, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 60.2s OverallTime, 35 OverallIterations, 34 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 0 SDslu, 1785 SDs, 0 SdLazy, 14875 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 728 SyntacticMatches, 33 SemanticMatches, 595 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 13.8s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 1457 NumberOfCodeBlocks, 1457 NumberOfCodeBlocksAsserted, 220 NumberOfCheckSat, 1390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002834 SizeOfPredicates, 2508 NumberOfNonLiveVariables, 24387 ConjunctsInSsa, 12111 ConjunctsInUnsatCore, 67 InterpolantComputations, 1 PerfectInterpolantSequences, 0/13090 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/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-51-23-442.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-51-23-442.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-51-23-442.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fib_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-51-23-442.csv Completed graceful shutdown