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/while_after_while_if_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:54:55,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:54:55,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:54:55,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:54:55,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:54:55,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:54:55,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:54:55,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:54:55,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:54:55,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:54:55,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:54:55,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:54:55,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:54:55,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:54:55,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:54:55,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:54:55,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:54:55,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:54:55,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:54:55,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:54:55,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:54:55,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:54:55,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:54:55,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:54:55,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:54:55,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:54:55,124 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:54:55,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:54:55,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:54:55,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:54:55,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:54:55,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:54:55,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:54:55,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:54:55,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:54:55,129 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:54:55,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:54:55,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:54:55,151 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:54:55,151 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:54:55,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:54:55,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:54:55,153 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:54:55,153 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:54:55,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:54:55,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:54:55,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:54:55,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:54:55,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:54:55,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:54:55,154 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:54:55,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:54:55,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:54:55,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:54:55,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:54:55,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:54:55,155 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:54:55,157 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:54:55,157 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:54:55,201 INFO ]: Repository-Root is: /tmp [2018-06-24 20:54:55,215 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:54:55,224 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:54:55,226 INFO ]: Initializing SmtParser... [2018-06-24 20:54:55,226 INFO ]: SmtParser initialized [2018-06-24 20:54:55,227 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/while_after_while_if_merged_safe.c-1.smt2 [2018-06-24 20:54:55,228 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:54:55,323 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/while_after_while_if_merged_safe.c-1.smt2 unknown [2018-06-24 20:54:55,595 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/while_after_while_if_merged_safe.c-1.smt2 [2018-06-24 20:54:55,600 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:54:55,618 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:54:55,618 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:54:55,618 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:54:55,623 INFO ]: ChcToBoogie initialized [2018-06-24 20:54:55,626 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,683 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55 Unit [2018-06-24 20:54:55,683 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:54:55,683 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:54:55,683 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:54:55,683 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:54:55,700 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,700 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,706 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,706 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,710 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,712 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,713 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... [2018-06-24 20:54:55,715 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:54:55,716 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:54:55,716 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:54:55,716 INFO ]: RCFGBuilder initialized [2018-06-24 20:54:55,717 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:54:55,733 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:54:55,733 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:54:55,733 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:54:55,733 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:54:55,733 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:54:55,733 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:54:56,058 INFO ]: Using library mode [2018-06-24 20:54:56,059 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:56 BoogieIcfgContainer [2018-06-24 20:54:56,059 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:54:56,060 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:54:56,060 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:54:56,061 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:54:56,061 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:56" (1/1) ... [2018-06-24 20:54:56,077 INFO ]: Initial Icfg 15 locations, 20 edges [2018-06-24 20:54:56,079 INFO ]: Using Remove infeasible edges [2018-06-24 20:54:56,079 INFO ]: Using Maximize final states [2018-06-24 20:54:56,080 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:54:56,080 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:54:56,081 INFO ]: Using Remove sink states [2018-06-24 20:54:56,082 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:54:56,082 INFO ]: Using Use SBE [2018-06-24 20:54:56,088 INFO ]: SBE split 0 edges [2018-06-24 20:54:56,094 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:54:56,095 INFO ]: 0 new accepting states [2018-06-24 20:54:56,142 INFO ]: Removed 10 edges and 4 locations by large block encoding [2018-06-24 20:54:56,144 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:54:56,147 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:54:56,147 INFO ]: 0 new accepting states [2018-06-24 20:54:56,148 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:54:56,148 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:54:56,148 INFO ]: Encoded RCFG 9 locations, 14 edges [2018-06-24 20:54:56,148 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:54:56 BasicIcfg [2018-06-24 20:54:56,148 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:54:56,154 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:54:56,154 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:54:56,157 INFO ]: TraceAbstraction initialized [2018-06-24 20:54:56,158 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:54:55" (1/4) ... [2018-06-24 20:54:56,158 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a5384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:54:56, skipping insertion in model container [2018-06-24 20:54:56,159 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:54:55" (2/4) ... [2018-06-24 20:54:56,159 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a5384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:54:56, skipping insertion in model container [2018-06-24 20:54:56,159 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:54:56" (3/4) ... [2018-06-24 20:54:56,159 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a5384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:54:56, skipping insertion in model container [2018-06-24 20:54:56,159 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:54:56" (4/4) ... [2018-06-24 20:54:56,161 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:54:56,171 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:54:56,177 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:54:56,219 INFO ]: Using default assertion order modulation [2018-06-24 20:54:56,219 INFO ]: Interprodecural is true [2018-06-24 20:54:56,219 INFO ]: Hoare is false [2018-06-24 20:54:56,219 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:54:56,219 INFO ]: Backedges is TWOTRACK [2018-06-24 20:54:56,219 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:54:56,219 INFO ]: Difference is false [2018-06-24 20:54:56,219 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:54:56,219 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:54:56,228 INFO ]: Start isEmpty. Operand 9 states. [2018-06-24 20:54:56,237 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:54:56,237 INFO ]: Found error trace [2018-06-24 20:54:56,243 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:56,244 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:56,248 INFO ]: Analyzing trace with hash -911570578, now seen corresponding path program 1 times [2018-06-24 20:54:56,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:56,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:56,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:56,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:56,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:56,348 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:56,431 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:56,432 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:56,432 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:54:56,434 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:54:56,446 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:54:56,447 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:56,449 INFO ]: Start difference. First operand 9 states. Second operand 5 states. [2018-06-24 20:54:56,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:56,895 INFO ]: Finished difference Result 21 states and 39 transitions. [2018-06-24 20:54:56,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:54:56,897 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:54:56,897 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:56,905 INFO ]: With dead ends: 21 [2018-06-24 20:54:56,905 INFO ]: Without dead ends: 21 [2018-06-24 20:54:56,907 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:56,920 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:54:56,951 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 12. [2018-06-24 20:54:56,952 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:54:56,953 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-06-24 20:54:56,954 INFO ]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-06-24 20:54:56,954 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:56,954 INFO ]: Abstraction has 12 states and 21 transitions. [2018-06-24 20:54:56,954 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:54:56,954 INFO ]: Start isEmpty. Operand 12 states and 21 transitions. [2018-06-24 20:54:56,955 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:56,955 INFO ]: Found error trace [2018-06-24 20:54:56,955 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:56,955 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:56,955 INFO ]: Analyzing trace with hash 1784162853, now seen corresponding path program 1 times [2018-06-24 20:54:56,955 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:56,955 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:56,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:56,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:56,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:56,992 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,268 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,268 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:57,268 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:54:57,270 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:54:57,270 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:54:57,270 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:57,270 INFO ]: Start difference. First operand 12 states and 21 transitions. Second operand 5 states. [2018-06-24 20:54:57,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:57,364 INFO ]: Finished difference Result 19 states and 35 transitions. [2018-06-24 20:54:57,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:54:57,365 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:54:57,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:57,366 INFO ]: With dead ends: 19 [2018-06-24 20:54:57,366 INFO ]: Without dead ends: 19 [2018-06-24 20:54:57,367 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:57,367 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:54:57,370 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-06-24 20:54:57,370 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:54:57,371 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2018-06-24 20:54:57,371 INFO ]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 8 [2018-06-24 20:54:57,371 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:57,371 INFO ]: Abstraction has 13 states and 24 transitions. [2018-06-24 20:54:57,371 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:54:57,371 INFO ]: Start isEmpty. Operand 13 states and 24 transitions. [2018-06-24 20:54:57,372 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:57,372 INFO ]: Found error trace [2018-06-24 20:54:57,372 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:57,372 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:57,372 INFO ]: Analyzing trace with hash 1803556794, now seen corresponding path program 1 times [2018-06-24 20:54:57,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:57,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:57,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:57,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:57,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:57,403 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,478 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,478 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:57,478 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:54:57,478 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:54:57,479 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:54:57,479 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:54:57,479 INFO ]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2018-06-24 20:54:57,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:57,544 INFO ]: Finished difference Result 18 states and 32 transitions. [2018-06-24 20:54:57,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:54:57,544 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-24 20:54:57,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:57,544 INFO ]: With dead ends: 18 [2018-06-24 20:54:57,544 INFO ]: Without dead ends: 18 [2018-06-24 20:54:57,545 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:57,545 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:54:57,547 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-06-24 20:54:57,547 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:54:57,548 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-24 20:54:57,548 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 8 [2018-06-24 20:54:57,548 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:57,548 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-24 20:54:57,548 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:54:57,548 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-24 20:54:57,548 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:57,548 INFO ]: Found error trace [2018-06-24 20:54:57,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:57,548 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:57,549 INFO ]: Analyzing trace with hash 1805731537, now seen corresponding path program 1 times [2018-06-24 20:54:57,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:57,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:57,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:57,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:57,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:57,564 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,690 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:57,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:54:57,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:57,778 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:57,785 INFO ]: Computing forward predicates... [2018-06-24 20:54:57,839 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:57,862 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:54:57,862 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-24 20:54:57,862 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:54:57,862 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:54:57,862 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:57,862 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 7 states. [2018-06-24 20:54:58,135 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:58,135 INFO ]: Finished difference Result 23 states and 41 transitions. [2018-06-24 20:54:58,136 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:54:58,136 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:54:58,136 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:58,137 INFO ]: With dead ends: 23 [2018-06-24 20:54:58,137 INFO ]: Without dead ends: 23 [2018-06-24 20:54:58,138 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:54:58,138 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:54:58,141 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-06-24 20:54:58,141 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:54:58,141 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-06-24 20:54:58,141 INFO ]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-06-24 20:54:58,141 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:58,141 INFO ]: Abstraction has 14 states and 25 transitions. [2018-06-24 20:54:58,141 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:54:58,141 INFO ]: Start isEmpty. Operand 14 states and 25 transitions. [2018-06-24 20:54:58,142 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:54:58,142 INFO ]: Found error trace [2018-06-24 20:54:58,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:58,142 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:58,142 INFO ]: Analyzing trace with hash 1805790158, now seen corresponding path program 1 times [2018-06-24 20:54:58,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:58,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:58,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,143 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:58,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,156 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:58,395 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:58,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:58,411 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:54:58,412 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:54:58,412 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:54:58,412 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:54:58,412 INFO ]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2018-06-24 20:54:58,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:58,621 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-24 20:54:58,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:54:58,622 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:54:58,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:58,623 INFO ]: With dead ends: 25 [2018-06-24 20:54:58,623 INFO ]: Without dead ends: 25 [2018-06-24 20:54:58,623 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:54:58,623 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:58,625 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-24 20:54:58,625 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:54:58,626 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2018-06-24 20:54:58,626 INFO ]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 8 [2018-06-24 20:54:58,626 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:58,626 INFO ]: Abstraction has 16 states and 28 transitions. [2018-06-24 20:54:58,626 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:54:58,626 INFO ]: Start isEmpty. Operand 16 states and 28 transitions. [2018-06-24 20:54:58,626 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:54:58,626 INFO ]: Found error trace [2018-06-24 20:54:58,627 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:58,627 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:58,627 INFO ]: Analyzing trace with hash -525878022, now seen corresponding path program 1 times [2018-06-24 20:54:58,627 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:58,627 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:58,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,628 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:58,628 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:58,641 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:58,788 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:58,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:58,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:58,795 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:58,831 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:58,834 INFO ]: Computing forward predicates... [2018-06-24 20:54:59,053 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,074 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:54:59,074 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:54:59,074 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:54:59,074 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:54:59,074 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:54:59,074 INFO ]: Start difference. First operand 16 states and 28 transitions. Second operand 11 states. [2018-06-24 20:54:59,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:59,191 INFO ]: Finished difference Result 36 states and 64 transitions. [2018-06-24 20:54:59,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:54:59,191 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 20:54:59,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:59,192 INFO ]: With dead ends: 36 [2018-06-24 20:54:59,192 INFO ]: Without dead ends: 36 [2018-06-24 20:54:59,192 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:54:59,192 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:54:59,196 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-06-24 20:54:59,196 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:54:59,196 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-24 20:54:59,197 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 9 [2018-06-24 20:54:59,197 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:59,197 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-24 20:54:59,197 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:54:59,197 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-24 20:54:59,197 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:54:59,197 INFO ]: Found error trace [2018-06-24 20:54:59,197 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:59,197 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:59,197 INFO ]: Analyzing trace with hash -525819401, now seen corresponding path program 1 times [2018-06-24 20:54:59,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:59,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:59,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:59,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,208 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,275 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,275 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:59,275 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:54:59,275 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:54:59,275 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:54:59,275 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:54:59,275 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 6 states. [2018-06-24 20:54:59,618 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:54:59,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:59,639 INFO ]: Finished difference Result 26 states and 47 transitions. [2018-06-24 20:54:59,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:54:59,640 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 20:54:59,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:59,641 INFO ]: With dead ends: 26 [2018-06-24 20:54:59,641 INFO ]: Without dead ends: 25 [2018-06-24 20:54:59,641 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:54:59,641 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:54:59,643 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-24 20:54:59,643 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:54:59,644 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions. [2018-06-24 20:54:59,644 INFO ]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 9 [2018-06-24 20:54:59,644 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:59,644 INFO ]: Abstraction has 22 states and 38 transitions. [2018-06-24 20:54:59,644 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:54:59,644 INFO ]: Start isEmpty. Operand 22 states and 38 transitions. [2018-06-24 20:54:59,644 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:54:59,644 INFO ]: Found error trace [2018-06-24 20:54:59,644 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:59,644 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:59,644 INFO ]: Analyzing trace with hash 75392770, now seen corresponding path program 1 times [2018-06-24 20:54:59,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:59,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:59,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:59,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,654 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,701 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,701 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:54:59,701 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:54:59,701 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:54:59,701 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:54:59,701 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:54:59,701 INFO ]: Start difference. First operand 22 states and 38 transitions. Second operand 5 states. [2018-06-24 20:54:59,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:54:59,743 INFO ]: Finished difference Result 35 states and 63 transitions. [2018-06-24 20:54:59,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:54:59,743 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:54:59,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:54:59,744 INFO ]: With dead ends: 35 [2018-06-24 20:54:59,744 INFO ]: Without dead ends: 35 [2018-06-24 20:54:59,744 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:54:59,745 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:54:59,747 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-06-24 20:54:59,747 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:54:59,749 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2018-06-24 20:54:59,749 INFO ]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 9 [2018-06-24 20:54:59,749 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:54:59,749 INFO ]: Abstraction has 30 states and 56 transitions. [2018-06-24 20:54:59,749 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:54:59,749 INFO ]: Start isEmpty. Operand 30 states and 56 transitions. [2018-06-24 20:54:59,749 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:54:59,749 INFO ]: Found error trace [2018-06-24 20:54:59,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:54:59,749 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:54:59,749 INFO ]: Analyzing trace with hash 142809803, now seen corresponding path program 1 times [2018-06-24 20:54:59,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:54:59,750 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:54:59,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:59,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:54:59,759 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,799 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:54:59,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:54:59,805 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:54:59,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:54:59,834 INFO ]: Computing forward predicates... [2018-06-24 20:54:59,950 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:54:59,972 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:54:59,972 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-06-24 20:54:59,972 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:54:59,973 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:54:59,973 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:54:59,973 INFO ]: Start difference. First operand 30 states and 56 transitions. Second operand 9 states. [2018-06-24 20:55:00,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:00,060 INFO ]: Finished difference Result 37 states and 66 transitions. [2018-06-24 20:55:00,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:55:00,061 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:55:00,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:00,061 INFO ]: With dead ends: 37 [2018-06-24 20:55:00,061 INFO ]: Without dead ends: 33 [2018-06-24 20:55:00,062 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:00,062 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:55:00,064 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-06-24 20:55:00,064 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:55:00,065 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 50 transitions. [2018-06-24 20:55:00,065 INFO ]: Start accepts. Automaton has 28 states and 50 transitions. Word has length 9 [2018-06-24 20:55:00,065 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:00,065 INFO ]: Abstraction has 28 states and 50 transitions. [2018-06-24 20:55:00,065 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:55:00,065 INFO ]: Start isEmpty. Operand 28 states and 50 transitions. [2018-06-24 20:55:00,066 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:55:00,066 INFO ]: Found error trace [2018-06-24 20:55:00,066 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:00,066 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:00,066 INFO ]: Analyzing trace with hash 144329144, now seen corresponding path program 1 times [2018-06-24 20:55:00,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:00,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:00,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,067 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:00,067 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,074 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,130 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:00,131 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:00,138 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:00,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,162 INFO ]: Computing forward predicates... [2018-06-24 20:55:00,245 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,276 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:55:00,276 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-24 20:55:00,276 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:55:00,276 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:55:00,276 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:55:00,277 INFO ]: Start difference. First operand 28 states and 50 transitions. Second operand 7 states. [2018-06-24 20:55:00,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:00,344 INFO ]: Finished difference Result 35 states and 60 transitions. [2018-06-24 20:55:00,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:55:00,345 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:55:00,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:00,345 INFO ]: With dead ends: 35 [2018-06-24 20:55:00,345 INFO ]: Without dead ends: 32 [2018-06-24 20:55:00,345 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:55:00,346 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:55:00,349 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-24 20:55:00,349 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:55:00,350 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2018-06-24 20:55:00,351 INFO ]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 9 [2018-06-24 20:55:00,351 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:00,351 INFO ]: Abstraction has 30 states and 53 transitions. [2018-06-24 20:55:00,351 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:55:00,351 INFO ]: Start isEmpty. Operand 30 states and 53 transitions. [2018-06-24 20:55:00,351 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:55:00,351 INFO ]: Found error trace [2018-06-24 20:55:00,351 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:00,351 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:00,351 INFO ]: Analyzing trace with hash 208669681, now seen corresponding path program 2 times [2018-06-24 20:55:00,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:00,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:00,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:00,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,414 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:00,414 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:00,419 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:00,451 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:00,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,452 INFO ]: Computing forward predicates... [2018-06-24 20:55:00,479 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,499 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:00,499 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:55:00,499 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:55:00,499 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:55:00,499 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:55:00,499 INFO ]: Start difference. First operand 30 states and 53 transitions. Second operand 9 states. [2018-06-24 20:55:00,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:00,589 INFO ]: Finished difference Result 49 states and 84 transitions. [2018-06-24 20:55:00,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:55:00,593 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:55:00,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:00,593 INFO ]: With dead ends: 49 [2018-06-24 20:55:00,593 INFO ]: Without dead ends: 49 [2018-06-24 20:55:00,594 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:00,594 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:55:00,597 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 25. [2018-06-24 20:55:00,597 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:55:00,598 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2018-06-24 20:55:00,598 INFO ]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 10 [2018-06-24 20:55:00,598 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:00,598 INFO ]: Abstraction has 25 states and 43 transitions. [2018-06-24 20:55:00,598 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:55:00,598 INFO ]: Start isEmpty. Operand 25 states and 43 transitions. [2018-06-24 20:55:00,598 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:55:00,598 INFO ]: Found error trace [2018-06-24 20:55:00,598 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:00,598 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:00,598 INFO ]: Analyzing trace with hash 877298885, now seen corresponding path program 3 times [2018-06-24 20:55:00,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:00,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:00,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,599 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:00,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:00,607 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,812 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,812 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:00,812 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:00,820 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:00,869 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:55:00,869 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:00,871 INFO ]: Computing forward predicates... [2018-06-24 20:55:00,915 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:00,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:00,934 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:55:00,934 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:55:00,934 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:55:00,935 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:55:00,935 INFO ]: Start difference. First operand 25 states and 43 transitions. Second operand 10 states. [2018-06-24 20:55:01,037 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:01,037 INFO ]: Finished difference Result 50 states and 83 transitions. [2018-06-24 20:55:01,038 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:55:01,038 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:55:01,038 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:01,039 INFO ]: With dead ends: 50 [2018-06-24 20:55:01,039 INFO ]: Without dead ends: 50 [2018-06-24 20:55:01,039 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:01,039 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:55:01,042 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 30. [2018-06-24 20:55:01,042 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:55:01,043 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2018-06-24 20:55:01,043 INFO ]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 10 [2018-06-24 20:55:01,043 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:01,043 INFO ]: Abstraction has 30 states and 54 transitions. [2018-06-24 20:55:01,043 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:55:01,043 INFO ]: Start isEmpty. Operand 30 states and 54 transitions. [2018-06-24 20:55:01,044 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:55:01,044 INFO ]: Found error trace [2018-06-24 20:55:01,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:01,044 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:01,044 INFO ]: Analyzing trace with hash 877357506, now seen corresponding path program 1 times [2018-06-24 20:55:01,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:01,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:01,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,045 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:01,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,167 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:01,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:01,167 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:01,175 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:01,214 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,216 INFO ]: Computing forward predicates... [2018-06-24 20:55:01,266 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:01,287 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:01,287 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:55:01,287 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:55:01,287 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:55:01,288 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:55:01,288 INFO ]: Start difference. First operand 30 states and 54 transitions. Second operand 10 states. [2018-06-24 20:55:01,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:01,440 INFO ]: Finished difference Result 52 states and 84 transitions. [2018-06-24 20:55:01,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:55:01,440 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:55:01,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:01,440 INFO ]: With dead ends: 52 [2018-06-24 20:55:01,440 INFO ]: Without dead ends: 51 [2018-06-24 20:55:01,441 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:55:01,441 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:55:01,444 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 31. [2018-06-24 20:55:01,444 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:55:01,445 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2018-06-24 20:55:01,445 INFO ]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 10 [2018-06-24 20:55:01,445 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:01,445 INFO ]: Abstraction has 31 states and 55 transitions. [2018-06-24 20:55:01,445 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:55:01,445 INFO ]: Start isEmpty. Operand 31 states and 55 transitions. [2018-06-24 20:55:01,446 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:55:01,446 INFO ]: Found error trace [2018-06-24 20:55:01,446 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:01,446 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:01,446 INFO ]: Analyzing trace with hash -1958382332, now seen corresponding path program 1 times [2018-06-24 20:55:01,446 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:01,446 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:01,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,447 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:01,447 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,460 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,633 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:01,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:01,633 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:01,638 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:01,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:01,684 INFO ]: Computing forward predicates... [2018-06-24 20:55:01,699 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:01,719 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:01,719 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:55:01,719 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:55:01,719 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:55:01,719 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:55:01,719 INFO ]: Start difference. First operand 31 states and 55 transitions. Second operand 9 states. [2018-06-24 20:55:01,869 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:01,869 INFO ]: Finished difference Result 45 states and 73 transitions. [2018-06-24 20:55:01,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:55:01,870 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:55:01,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:01,870 INFO ]: With dead ends: 45 [2018-06-24 20:55:01,870 INFO ]: Without dead ends: 45 [2018-06-24 20:55:01,871 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:01,871 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:55:01,874 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-06-24 20:55:01,874 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:55:01,874 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2018-06-24 20:55:01,874 INFO ]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 10 [2018-06-24 20:55:01,875 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:01,875 INFO ]: Abstraction has 34 states and 59 transitions. [2018-06-24 20:55:01,875 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:55:01,875 INFO ]: Start isEmpty. Operand 34 states and 59 transitions. [2018-06-24 20:55:01,875 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:55:01,875 INFO ]: Found error trace [2018-06-24 20:55:01,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:01,875 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:01,875 INFO ]: Analyzing trace with hash -1070878651, now seen corresponding path program 1 times [2018-06-24 20:55:01,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:01,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:01,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:01,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:01,883 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:02,075 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:55:02,075 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:55:02,075 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:55:02,075 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:55:02,075 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:55:02,075 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:55:02,075 INFO ]: Start difference. First operand 34 states and 59 transitions. Second operand 5 states. [2018-06-24 20:55:02,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:02,118 INFO ]: Finished difference Result 41 states and 64 transitions. [2018-06-24 20:55:02,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:55:02,118 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-24 20:55:02,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:02,118 INFO ]: With dead ends: 41 [2018-06-24 20:55:02,118 INFO ]: Without dead ends: 34 [2018-06-24 20:55:02,119 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:55:02,119 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:55:02,121 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-24 20:55:02,121 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:55:02,121 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2018-06-24 20:55:02,121 INFO ]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 10 [2018-06-24 20:55:02,121 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:02,121 INFO ]: Abstraction has 32 states and 48 transitions. [2018-06-24 20:55:02,121 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:55:02,121 INFO ]: Start isEmpty. Operand 32 states and 48 transitions. [2018-06-24 20:55:02,122 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:55:02,122 INFO ]: Found error trace [2018-06-24 20:55:02,122 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:02,122 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:02,122 INFO ]: Analyzing trace with hash -2121526098, now seen corresponding path program 4 times [2018-06-24 20:55:02,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:02,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:02,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:02,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:02,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:02,133 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:02,264 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:02,264 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:02,264 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:02,270 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:02,306 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:02,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:02,308 INFO ]: Computing forward predicates... [2018-06-24 20:55:02,392 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:02,424 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:02,424 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-24 20:55:02,425 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:55:02,425 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:55:02,425 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:55:02,425 INFO ]: Start difference. First operand 32 states and 48 transitions. Second operand 14 states. [2018-06-24 20:55:02,634 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:02,634 INFO ]: Finished difference Result 67 states and 99 transitions. [2018-06-24 20:55:02,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:55:02,634 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-24 20:55:02,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:02,635 INFO ]: With dead ends: 67 [2018-06-24 20:55:02,635 INFO ]: Without dead ends: 67 [2018-06-24 20:55:02,635 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:02,635 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-24 20:55:02,639 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 38. [2018-06-24 20:55:02,639 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:55:02,639 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2018-06-24 20:55:02,639 INFO ]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 11 [2018-06-24 20:55:02,639 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:02,639 INFO ]: Abstraction has 38 states and 59 transitions. [2018-06-24 20:55:02,639 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:55:02,639 INFO ]: Start isEmpty. Operand 38 states and 59 transitions. [2018-06-24 20:55:02,640 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:55:02,640 INFO ]: Found error trace [2018-06-24 20:55:02,640 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:02,640 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:02,640 INFO ]: Analyzing trace with hash -2121467477, now seen corresponding path program 2 times [2018-06-24 20:55:02,640 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:02,640 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:02,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:02,641 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:02,641 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:02,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:02,889 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:02,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:02,889 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:02,901 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:02,922 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:02,922 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:02,924 INFO ]: Computing forward predicates... [2018-06-24 20:55:02,980 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:02,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:02,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-24 20:55:03,000 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:55:03,000 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:55:03,000 INFO ]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:55:03,000 INFO ]: Start difference. First operand 38 states and 59 transitions. Second operand 11 states. [2018-06-24 20:55:03,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:03,081 INFO ]: Finished difference Result 55 states and 81 transitions. [2018-06-24 20:55:03,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:55:03,081 INFO ]: Start accepts. Automaton has 11 states. Word has length 11 [2018-06-24 20:55:03,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:03,082 INFO ]: With dead ends: 55 [2018-06-24 20:55:03,082 INFO ]: Without dead ends: 52 [2018-06-24 20:55:03,082 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:03,082 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:55:03,084 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-06-24 20:55:03,084 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:55:03,084 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2018-06-24 20:55:03,084 INFO ]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 11 [2018-06-24 20:55:03,084 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:03,084 INFO ]: Abstraction has 41 states and 62 transitions. [2018-06-24 20:55:03,084 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:55:03,084 INFO ]: Start isEmpty. Operand 41 states and 62 transitions. [2018-06-24 20:55:03,085 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:55:03,085 INFO ]: Found error trace [2018-06-24 20:55:03,085 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:03,085 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:03,085 INFO ]: Analyzing trace with hash 1426168663, now seen corresponding path program 3 times [2018-06-24 20:55:03,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:03,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:03,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,085 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:03,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,092 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,188 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,188 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:03,188 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:03,193 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:03,220 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:55:03,220 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,221 INFO ]: Computing forward predicates... [2018-06-24 20:55:03,260 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:03,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:55:03,279 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:55:03,279 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:55:03,279 INFO ]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:03,279 INFO ]: Start difference. First operand 41 states and 62 transitions. Second operand 12 states. [2018-06-24 20:55:03,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:03,406 INFO ]: Finished difference Result 54 states and 78 transitions. [2018-06-24 20:55:03,408 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:55:03,408 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:55:03,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:03,409 INFO ]: With dead ends: 54 [2018-06-24 20:55:03,409 INFO ]: Without dead ends: 47 [2018-06-24 20:55:03,409 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:03,409 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:55:03,411 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-24 20:55:03,411 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:55:03,412 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2018-06-24 20:55:03,412 INFO ]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 11 [2018-06-24 20:55:03,412 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:03,412 INFO ]: Abstraction has 39 states and 58 transitions. [2018-06-24 20:55:03,412 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:55:03,412 INFO ]: Start isEmpty. Operand 39 states and 58 transitions. [2018-06-24 20:55:03,413 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:55:03,413 INFO ]: Found error trace [2018-06-24 20:55:03,413 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:03,413 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:03,413 INFO ]: Analyzing trace with hash 1577038648, now seen corresponding path program 2 times [2018-06-24 20:55:03,413 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:03,413 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:03,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,413 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:03,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,430 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,533 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,533 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:03,533 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:03,539 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:03,561 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:03,561 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,563 INFO ]: Computing forward predicates... [2018-06-24 20:55:03,688 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,706 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:03,707 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-24 20:55:03,707 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:55:03,707 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:55:03,707 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:55:03,707 INFO ]: Start difference. First operand 39 states and 58 transitions. Second operand 9 states. [2018-06-24 20:55:03,785 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:03,785 INFO ]: Finished difference Result 57 states and 83 transitions. [2018-06-24 20:55:03,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:55:03,785 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:55:03,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:03,785 INFO ]: With dead ends: 57 [2018-06-24 20:55:03,785 INFO ]: Without dead ends: 57 [2018-06-24 20:55:03,786 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:03,786 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:55:03,788 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-24 20:55:03,788 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-24 20:55:03,788 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2018-06-24 20:55:03,788 INFO ]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 11 [2018-06-24 20:55:03,788 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:03,788 INFO ]: Abstraction has 44 states and 65 transitions. [2018-06-24 20:55:03,789 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:55:03,789 INFO ]: Start isEmpty. Operand 44 states and 65 transitions. [2018-06-24 20:55:03,789 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:55:03,789 INFO ]: Found error trace [2018-06-24 20:55:03,789 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:03,789 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:03,789 INFO ]: Analyzing trace with hash -580901054, now seen corresponding path program 3 times [2018-06-24 20:55:03,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:03,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:03,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,790 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:03,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:03,797 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,836 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:03,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:03,842 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:03,866 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:55:03,866 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:03,868 INFO ]: Computing forward predicates... [2018-06-24 20:55:03,901 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:03,921 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:03,921 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-24 20:55:03,921 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:55:03,921 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:55:03,922 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:55:03,922 INFO ]: Start difference. First operand 44 states and 65 transitions. Second operand 10 states. [2018-06-24 20:55:04,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:04,009 INFO ]: Finished difference Result 62 states and 88 transitions. [2018-06-24 20:55:04,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:55:04,009 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:55:04,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:04,009 INFO ]: With dead ends: 62 [2018-06-24 20:55:04,009 INFO ]: Without dead ends: 58 [2018-06-24 20:55:04,010 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:04,010 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:55:04,012 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-06-24 20:55:04,012 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:55:04,013 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2018-06-24 20:55:04,013 INFO ]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 11 [2018-06-24 20:55:04,013 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:04,013 INFO ]: Abstraction has 46 states and 67 transitions. [2018-06-24 20:55:04,013 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:55:04,013 INFO ]: Start isEmpty. Operand 46 states and 67 transitions. [2018-06-24 20:55:04,014 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:55:04,014 INFO ]: Found error trace [2018-06-24 20:55:04,014 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:04,014 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:04,014 INFO ]: Analyzing trace with hash -595820059, now seen corresponding path program 5 times [2018-06-24 20:55:04,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:04,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:04,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:04,015 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:04,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:04,022 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:04,700 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:04,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:04,700 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:04,706 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:04,732 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:55:04,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:04,733 INFO ]: Computing forward predicates... [2018-06-24 20:55:04,823 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:04,844 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:04,844 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:55:04,844 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:55:04,844 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:55:04,844 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:04,844 INFO ]: Start difference. First operand 46 states and 67 transitions. Second operand 12 states. [2018-06-24 20:55:05,011 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:05,011 INFO ]: Finished difference Result 85 states and 120 transitions. [2018-06-24 20:55:05,011 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:55:05,011 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 20:55:05,012 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:05,012 INFO ]: With dead ends: 85 [2018-06-24 20:55:05,012 INFO ]: Without dead ends: 85 [2018-06-24 20:55:05,012 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:05,012 INFO ]: Start minimizeSevpa. Operand 85 states. [2018-06-24 20:55:05,014 INFO ]: Finished minimizeSevpa. Reduced states from 85 to 41. [2018-06-24 20:55:05,014 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:55:05,014 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2018-06-24 20:55:05,014 INFO ]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 12 [2018-06-24 20:55:05,014 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:05,014 INFO ]: Abstraction has 41 states and 58 transitions. [2018-06-24 20:55:05,014 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:55:05,014 INFO ]: Start isEmpty. Operand 41 states and 58 transitions. [2018-06-24 20:55:05,015 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:55:05,015 INFO ]: Found error trace [2018-06-24 20:55:05,015 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:05,015 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:05,015 INFO ]: Analyzing trace with hash -1343151215, now seen corresponding path program 6 times [2018-06-24 20:55:05,015 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:05,015 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:05,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:05,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:05,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:05,023 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:05,093 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:05,093 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:05,093 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:05,098 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:05,124 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:55:05,124 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:05,126 INFO ]: Computing forward predicates... [2018-06-24 20:55:05,451 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:05,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:05,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:55:05,470 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:55:05,470 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:55:05,470 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:05,470 INFO ]: Start difference. First operand 41 states and 58 transitions. Second operand 13 states. [2018-06-24 20:55:05,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:05,660 INFO ]: Finished difference Result 86 states and 119 transitions. [2018-06-24 20:55:05,662 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:55:05,663 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-24 20:55:05,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:05,663 INFO ]: With dead ends: 86 [2018-06-24 20:55:05,663 INFO ]: Without dead ends: 81 [2018-06-24 20:55:05,664 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:55:05,664 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-24 20:55:05,666 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 46. [2018-06-24 20:55:05,666 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 20:55:05,667 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2018-06-24 20:55:05,667 INFO ]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 12 [2018-06-24 20:55:05,667 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:05,667 INFO ]: Abstraction has 46 states and 66 transitions. [2018-06-24 20:55:05,667 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:55:05,667 INFO ]: Start isEmpty. Operand 46 states and 66 transitions. [2018-06-24 20:55:05,667 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:55:05,668 INFO ]: Found error trace [2018-06-24 20:55:05,668 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:05,668 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:05,672 INFO ]: Analyzing trace with hash -1343092594, now seen corresponding path program 4 times [2018-06-24 20:55:05,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:05,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:05,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:05,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:05,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:05,682 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:06,352 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:06,352 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:06,352 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:06,358 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:06,396 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:06,396 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:06,399 INFO ]: Computing forward predicates... [2018-06-24 20:55:06,466 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:06,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:06,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-24 20:55:06,486 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:55:06,486 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:55:06,486 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:06,486 INFO ]: Start difference. First operand 46 states and 66 transitions. Second operand 12 states. [2018-06-24 20:55:06,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:06,630 INFO ]: Finished difference Result 76 states and 103 transitions. [2018-06-24 20:55:06,631 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:55:06,631 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-24 20:55:06,631 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:06,632 INFO ]: With dead ends: 76 [2018-06-24 20:55:06,632 INFO ]: Without dead ends: 75 [2018-06-24 20:55:06,632 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:55:06,632 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-24 20:55:06,634 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-06-24 20:55:06,634 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 20:55:06,634 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2018-06-24 20:55:06,634 INFO ]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 12 [2018-06-24 20:55:06,635 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:06,635 INFO ]: Abstraction has 47 states and 67 transitions. [2018-06-24 20:55:06,635 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:55:06,635 INFO ]: Start isEmpty. Operand 47 states and 67 transitions. [2018-06-24 20:55:06,635 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:55:06,635 INFO ]: Found error trace [2018-06-24 20:55:06,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:06,635 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:06,635 INFO ]: Analyzing trace with hash 897705414, now seen corresponding path program 1 times [2018-06-24 20:55:06,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:06,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:06,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:06,636 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:06,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:06,647 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:07,021 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:07,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:07,021 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:07,026 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:07,052 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:07,054 INFO ]: Computing forward predicates... [2018-06-24 20:55:07,149 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:07,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:07,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:55:07,168 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:55:07,168 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:55:07,168 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:55:07,168 INFO ]: Start difference. First operand 47 states and 67 transitions. Second operand 11 states. [2018-06-24 20:55:07,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:07,328 INFO ]: Finished difference Result 59 states and 80 transitions. [2018-06-24 20:55:07,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:55:07,328 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:55:07,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:07,328 INFO ]: With dead ends: 59 [2018-06-24 20:55:07,328 INFO ]: Without dead ends: 55 [2018-06-24 20:55:07,328 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:07,328 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:55:07,330 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-06-24 20:55:07,330 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-24 20:55:07,331 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2018-06-24 20:55:07,331 INFO ]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 12 [2018-06-24 20:55:07,331 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:07,331 INFO ]: Abstraction has 45 states and 64 transitions. [2018-06-24 20:55:07,331 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:55:07,331 INFO ]: Start isEmpty. Operand 45 states and 64 transitions. [2018-06-24 20:55:07,331 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:55:07,331 INFO ]: Found error trace [2018-06-24 20:55:07,331 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:07,331 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:07,332 INFO ]: Analyzing trace with hash 1642966926, now seen corresponding path program 4 times [2018-06-24 20:55:07,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:07,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:07,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:07,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:07,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:07,341 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:07,582 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:07,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:07,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:07,588 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:07,611 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:07,611 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:07,613 INFO ]: Computing forward predicates... [2018-06-24 20:55:07,661 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:07,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:07,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:55:07,680 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:55:07,680 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:55:07,680 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:55:07,680 INFO ]: Start difference. First operand 45 states and 64 transitions. Second operand 11 states. [2018-06-24 20:55:07,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:07,865 INFO ]: Finished difference Result 58 states and 80 transitions. [2018-06-24 20:55:07,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:55:07,865 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:55:07,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:07,865 INFO ]: With dead ends: 58 [2018-06-24 20:55:07,865 INFO ]: Without dead ends: 58 [2018-06-24 20:55:07,865 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:55:07,865 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:55:07,866 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-06-24 20:55:07,866 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 20:55:07,866 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2018-06-24 20:55:07,866 INFO ]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 12 [2018-06-24 20:55:07,867 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:07,867 INFO ]: Abstraction has 48 states and 68 transitions. [2018-06-24 20:55:07,867 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:55:07,867 INFO ]: Start isEmpty. Operand 48 states and 68 transitions. [2018-06-24 20:55:07,867 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:55:07,867 INFO ]: Found error trace [2018-06-24 20:55:07,867 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:07,867 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:07,867 INFO ]: Analyzing trace with hash -1290904262, now seen corresponding path program 7 times [2018-06-24 20:55:07,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:07,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:07,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:07,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:07,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:07,878 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,119 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:08,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:08,119 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:08,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:08,151 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,153 INFO ]: Computing forward predicates... [2018-06-24 20:55:08,265 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:08,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:08,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-24 20:55:08,284 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:08,284 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:08,284 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:08,284 INFO ]: Start difference. First operand 48 states and 68 transitions. Second operand 17 states. [2018-06-24 20:55:08,495 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:08,495 INFO ]: Finished difference Result 106 states and 147 transitions. [2018-06-24 20:55:08,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:55:08,495 INFO ]: Start accepts. Automaton has 17 states. Word has length 13 [2018-06-24 20:55:08,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:08,496 INFO ]: With dead ends: 106 [2018-06-24 20:55:08,496 INFO ]: Without dead ends: 106 [2018-06-24 20:55:08,496 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:08,496 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-24 20:55:08,498 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 55. [2018-06-24 20:55:08,498 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 20:55:08,499 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2018-06-24 20:55:08,499 INFO ]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2018-06-24 20:55:08,499 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:08,499 INFO ]: Abstraction has 55 states and 80 transitions. [2018-06-24 20:55:08,499 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:08,499 INFO ]: Start isEmpty. Operand 55 states and 80 transitions. [2018-06-24 20:55:08,499 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:55:08,499 INFO ]: Found error trace [2018-06-24 20:55:08,499 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:08,500 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:08,500 INFO ]: Analyzing trace with hash -1290845641, now seen corresponding path program 5 times [2018-06-24 20:55:08,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:08,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:08,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:08,500 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:08,500 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:08,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,572 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:08,572 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:08,572 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:08,578 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:08,606 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:55:08,606 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,607 INFO ]: Computing forward predicates... [2018-06-24 20:55:08,641 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:08,660 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:08,660 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-24 20:55:08,661 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:55:08,661 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:55:08,661 INFO ]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:55:08,661 INFO ]: Start difference. First operand 55 states and 80 transitions. Second operand 14 states. [2018-06-24 20:55:08,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:08,842 INFO ]: Finished difference Result 89 states and 123 transitions. [2018-06-24 20:55:08,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:55:08,842 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-24 20:55:08,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:08,843 INFO ]: With dead ends: 89 [2018-06-24 20:55:08,843 INFO ]: Without dead ends: 84 [2018-06-24 20:55:08,843 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:08,843 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 20:55:08,845 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 60. [2018-06-24 20:55:08,845 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:55:08,846 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2018-06-24 20:55:08,846 INFO ]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 13 [2018-06-24 20:55:08,846 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:08,846 INFO ]: Abstraction has 60 states and 86 transitions. [2018-06-24 20:55:08,846 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:55:08,846 INFO ]: Start isEmpty. Operand 60 states and 86 transitions. [2018-06-24 20:55:08,846 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:55:08,846 INFO ]: Found error trace [2018-06-24 20:55:08,846 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:08,846 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:08,846 INFO ]: Analyzing trace with hash 1311692299, now seen corresponding path program 6 times [2018-06-24 20:55:08,846 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:08,846 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:08,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:08,847 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:08,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:08,854 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,934 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:08,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:08,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:08,939 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:08,964 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:55:08,965 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:08,966 INFO ]: Computing forward predicates... [2018-06-24 20:55:09,011 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:09,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:09,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:55:09,030 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:09,030 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:09,030 INFO ]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:09,030 INFO ]: Start difference. First operand 60 states and 86 transitions. Second operand 15 states. [2018-06-24 20:55:09,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:09,154 INFO ]: Finished difference Result 89 states and 121 transitions. [2018-06-24 20:55:09,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:55:09,155 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:55:09,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:09,155 INFO ]: With dead ends: 89 [2018-06-24 20:55:09,155 INFO ]: Without dead ends: 78 [2018-06-24 20:55:09,156 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:55:09,156 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-24 20:55:09,158 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-06-24 20:55:09,158 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 20:55:09,158 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2018-06-24 20:55:09,158 INFO ]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 13 [2018-06-24 20:55:09,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:09,158 INFO ]: Abstraction has 60 states and 84 transitions. [2018-06-24 20:55:09,158 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:09,158 INFO ]: Start isEmpty. Operand 60 states and 84 transitions. [2018-06-24 20:55:09,159 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:55:09,159 INFO ]: Found error trace [2018-06-24 20:55:09,159 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:09,159 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:09,159 INFO ]: Analyzing trace with hash 1863397570, now seen corresponding path program 5 times [2018-06-24 20:55:09,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:09,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:09,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:09,160 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:09,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:09,166 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:09,360 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:09,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:09,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:09,365 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:09,431 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:55:09,431 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:09,433 INFO ]: Computing forward predicates... [2018-06-24 20:55:09,586 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:09,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:09,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-06-24 20:55:09,606 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:55:09,606 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:55:09,606 INFO ]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:55:09,606 INFO ]: Start difference. First operand 60 states and 84 transitions. Second operand 12 states. [2018-06-24 20:55:09,670 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:09,670 INFO ]: Finished difference Result 92 states and 127 transitions. [2018-06-24 20:55:09,670 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:55:09,670 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 20:55:09,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:09,670 INFO ]: With dead ends: 92 [2018-06-24 20:55:09,670 INFO ]: Without dead ends: 92 [2018-06-24 20:55:09,671 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:09,671 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-24 20:55:09,673 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 68. [2018-06-24 20:55:09,673 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 20:55:09,673 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-06-24 20:55:09,673 INFO ]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 13 [2018-06-24 20:55:09,673 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:09,673 INFO ]: Abstraction has 68 states and 95 transitions. [2018-06-24 20:55:09,673 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:55:09,673 INFO ]: Start isEmpty. Operand 68 states and 95 transitions. [2018-06-24 20:55:09,674 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:55:09,674 INFO ]: Found error trace [2018-06-24 20:55:09,674 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:09,674 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:09,674 INFO ]: Analyzing trace with hash -608223752, now seen corresponding path program 6 times [2018-06-24 20:55:09,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:09,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:09,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:09,674 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:09,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:09,681 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:09,797 INFO ]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:09,797 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:09,797 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:09,803 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:09,829 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:55:09,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:09,830 INFO ]: Computing forward predicates... [2018-06-24 20:55:09,895 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:09,915 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:09,915 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-24 20:55:09,915 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:55:09,915 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:55:09,915 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:09,915 INFO ]: Start difference. First operand 68 states and 95 transitions. Second operand 13 states. [2018-06-24 20:55:10,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:10,052 INFO ]: Finished difference Result 99 states and 134 transitions. [2018-06-24 20:55:10,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:55:10,052 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-24 20:55:10,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:10,053 INFO ]: With dead ends: 99 [2018-06-24 20:55:10,053 INFO ]: Without dead ends: 94 [2018-06-24 20:55:10,053 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:55:10,053 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-24 20:55:10,055 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 70. [2018-06-24 20:55:10,055 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 20:55:10,056 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2018-06-24 20:55:10,056 INFO ]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 13 [2018-06-24 20:55:10,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:10,056 INFO ]: Abstraction has 70 states and 97 transitions. [2018-06-24 20:55:10,056 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:55:10,056 INFO ]: Start isEmpty. Operand 70 states and 97 transitions. [2018-06-24 20:55:10,056 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:10,056 INFO ]: Found error trace [2018-06-24 20:55:10,056 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:10,057 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:10,057 INFO ]: Analyzing trace with hash 328751281, now seen corresponding path program 8 times [2018-06-24 20:55:10,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:10,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:10,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:10,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:10,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:10,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:10,185 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:10,185 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:10,185 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:10,191 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:10,220 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:10,220 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:10,222 INFO ]: Computing forward predicates... [2018-06-24 20:55:10,300 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:10,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:10,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:55:10,331 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:10,331 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:10,332 INFO ]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:10,332 INFO ]: Start difference. First operand 70 states and 97 transitions. Second operand 15 states. [2018-06-24 20:55:10,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:10,476 INFO ]: Finished difference Result 137 states and 182 transitions. [2018-06-24 20:55:10,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:55:10,477 INFO ]: Start accepts. Automaton has 15 states. Word has length 14 [2018-06-24 20:55:10,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:10,477 INFO ]: With dead ends: 137 [2018-06-24 20:55:10,477 INFO ]: Without dead ends: 137 [2018-06-24 20:55:10,478 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:10,478 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-24 20:55:10,481 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 64. [2018-06-24 20:55:10,481 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-24 20:55:10,482 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2018-06-24 20:55:10,482 INFO ]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 14 [2018-06-24 20:55:10,482 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:10,482 INFO ]: Abstraction has 64 states and 87 transitions. [2018-06-24 20:55:10,482 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:10,482 INFO ]: Start isEmpty. Operand 64 states and 87 transitions. [2018-06-24 20:55:10,482 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:10,482 INFO ]: Found error trace [2018-06-24 20:55:10,482 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:10,482 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:10,482 INFO ]: Analyzing trace with hash -1363678075, now seen corresponding path program 9 times [2018-06-24 20:55:10,482 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:10,482 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:10,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:10,483 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:10,483 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:10,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:10,661 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:10,661 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:10,661 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:10,666 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:10,712 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:55:10,712 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:10,714 INFO ]: Computing forward predicates... [2018-06-24 20:55:10,788 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:10,807 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:10,807 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-24 20:55:10,807 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:55:10,807 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:55:10,807 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:10,807 INFO ]: Start difference. First operand 64 states and 87 transitions. Second operand 16 states. [2018-06-24 20:55:11,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:11,016 INFO ]: Finished difference Result 138 states and 181 transitions. [2018-06-24 20:55:11,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:55:11,016 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-24 20:55:11,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:11,017 INFO ]: With dead ends: 138 [2018-06-24 20:55:11,017 INFO ]: Without dead ends: 132 [2018-06-24 20:55:11,017 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:55:11,017 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-24 20:55:11,020 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 70. [2018-06-24 20:55:11,020 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 20:55:11,020 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-06-24 20:55:11,020 INFO ]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 14 [2018-06-24 20:55:11,020 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:11,020 INFO ]: Abstraction has 70 states and 96 transitions. [2018-06-24 20:55:11,020 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:55:11,021 INFO ]: Start isEmpty. Operand 70 states and 96 transitions. [2018-06-24 20:55:11,021 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:11,021 INFO ]: Found error trace [2018-06-24 20:55:11,021 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:11,021 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:11,021 INFO ]: Analyzing trace with hash -1363619454, now seen corresponding path program 7 times [2018-06-24 20:55:11,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:11,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:11,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:11,022 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:11,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:11,030 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:11,161 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:11,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:11,161 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:11,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:11,195 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:11,197 INFO ]: Computing forward predicates... [2018-06-24 20:55:11,246 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:11,265 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:11,265 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-24 20:55:11,265 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:55:11,265 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:55:11,265 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:55:11,265 INFO ]: Start difference. First operand 70 states and 96 transitions. Second operand 14 states. [2018-06-24 20:55:11,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:11,437 INFO ]: Finished difference Result 124 states and 160 transitions. [2018-06-24 20:55:11,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:55:11,437 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-24 20:55:11,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:11,438 INFO ]: With dead ends: 124 [2018-06-24 20:55:11,438 INFO ]: Without dead ends: 123 [2018-06-24 20:55:11,438 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:55:11,438 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-24 20:55:11,441 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 71. [2018-06-24 20:55:11,441 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 20:55:11,441 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2018-06-24 20:55:11,441 INFO ]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 14 [2018-06-24 20:55:11,442 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:11,442 INFO ]: Abstraction has 71 states and 97 transitions. [2018-06-24 20:55:11,442 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:55:11,442 INFO ]: Start isEmpty. Operand 71 states and 97 transitions. [2018-06-24 20:55:11,442 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:11,442 INFO ]: Found error trace [2018-06-24 20:55:11,442 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:11,442 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:11,442 INFO ]: Analyzing trace with hash -663938172, now seen corresponding path program 2 times [2018-06-24 20:55:11,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:11,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:11,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:11,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:11,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:11,780 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:11,780 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:11,780 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:11,786 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:11,821 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:11,821 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:11,824 INFO ]: Computing forward predicates... [2018-06-24 20:55:11,853 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:11,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:11,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:55:11,872 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:55:11,872 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:55:11,872 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:11,872 INFO ]: Start difference. First operand 71 states and 97 transitions. Second operand 13 states. [2018-06-24 20:55:12,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:12,069 INFO ]: Finished difference Result 100 states and 128 transitions. [2018-06-24 20:55:12,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:55:12,069 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:55:12,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:12,070 INFO ]: With dead ends: 100 [2018-06-24 20:55:12,070 INFO ]: Without dead ends: 95 [2018-06-24 20:55:12,070 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:12,070 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-24 20:55:12,071 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 68. [2018-06-24 20:55:12,071 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 20:55:12,071 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2018-06-24 20:55:12,071 INFO ]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 14 [2018-06-24 20:55:12,072 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:12,072 INFO ]: Abstraction has 68 states and 93 transitions. [2018-06-24 20:55:12,072 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:55:12,072 INFO ]: Start isEmpty. Operand 68 states and 93 transitions. [2018-06-24 20:55:12,072 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:12,072 INFO ]: Found error trace [2018-06-24 20:55:12,072 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:12,072 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:12,072 INFO ]: Analyzing trace with hash -448654910, now seen corresponding path program 3 times [2018-06-24 20:55:12,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:12,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:12,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:12,073 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:12,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:12,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:12,308 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:12,308 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:12,308 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:12,318 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:12,354 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:55:12,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:12,356 INFO ]: Computing forward predicates... [2018-06-24 20:55:12,393 INFO ]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:12,412 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:12,412 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:55:12,412 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:55:12,412 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:55:12,412 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:12,412 INFO ]: Start difference. First operand 68 states and 93 transitions. Second operand 13 states. [2018-06-24 20:55:12,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:12,639 INFO ]: Finished difference Result 87 states and 113 transitions. [2018-06-24 20:55:12,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:55:12,639 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:55:12,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:12,639 INFO ]: With dead ends: 87 [2018-06-24 20:55:12,639 INFO ]: Without dead ends: 82 [2018-06-24 20:55:12,640 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:55:12,640 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 20:55:12,641 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-06-24 20:55:12,641 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-24 20:55:12,642 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2018-06-24 20:55:12,642 INFO ]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 14 [2018-06-24 20:55:12,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:12,642 INFO ]: Abstraction has 68 states and 92 transitions. [2018-06-24 20:55:12,642 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:55:12,642 INFO ]: Start isEmpty. Operand 68 states and 92 transitions. [2018-06-24 20:55:12,642 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:55:12,642 INFO ]: Found error trace [2018-06-24 20:55:12,642 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:12,642 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:12,642 INFO ]: Analyzing trace with hash 1930158916, now seen corresponding path program 7 times [2018-06-24 20:55:12,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:12,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:12,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:12,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:12,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:12,660 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:12,759 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:12,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:12,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:12,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:12,789 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:12,792 INFO ]: Computing forward predicates... [2018-06-24 20:55:12,832 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:12,851 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:12,851 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:55:12,852 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:55:12,852 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:55:12,852 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:55:12,852 INFO ]: Start difference. First operand 68 states and 92 transitions. Second operand 13 states. [2018-06-24 20:55:13,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:13,065 INFO ]: Finished difference Result 83 states and 110 transitions. [2018-06-24 20:55:13,065 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:55:13,065 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:55:13,065 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:13,065 INFO ]: With dead ends: 83 [2018-06-24 20:55:13,065 INFO ]: Without dead ends: 83 [2018-06-24 20:55:13,066 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:55:13,066 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 20:55:13,067 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 71. [2018-06-24 20:55:13,067 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 20:55:13,067 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2018-06-24 20:55:13,067 INFO ]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 14 [2018-06-24 20:55:13,068 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:13,068 INFO ]: Abstraction has 71 states and 96 transitions. [2018-06-24 20:55:13,068 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:55:13,068 INFO ]: Start isEmpty. Operand 71 states and 96 transitions. [2018-06-24 20:55:13,068 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:55:13,068 INFO ]: Found error trace [2018-06-24 20:55:13,068 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:13,068 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:13,068 INFO ]: Analyzing trace with hash 1601003502, now seen corresponding path program 10 times [2018-06-24 20:55:13,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:13,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:13,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:13,068 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:13,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:13,075 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:13,292 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:13,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:13,292 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-24 20:55:13,297 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:13,340 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:13,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:13,343 INFO ]: Computing forward predicates... [2018-06-24 20:55:13,500 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:13,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:13,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-24 20:55:13,519 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:55:13,519 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:55:13,519 INFO ]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:13,519 INFO ]: Start difference. First operand 71 states and 96 transitions. Second operand 20 states. [2018-06-24 20:55:13,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:13,993 INFO ]: Finished difference Result 161 states and 212 transitions. [2018-06-24 20:55:13,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:55:13,993 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-24 20:55:13,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:13,994 INFO ]: With dead ends: 161 [2018-06-24 20:55:13,994 INFO ]: Without dead ends: 161 [2018-06-24 20:55:13,995 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:55:13,995 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-24 20:55:13,998 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 79. [2018-06-24 20:55:13,998 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 20:55:13,999 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2018-06-24 20:55:13,999 INFO ]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 15 [2018-06-24 20:55:14,001 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:14,001 INFO ]: Abstraction has 79 states and 109 transitions. [2018-06-24 20:55:14,001 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:55:14,001 INFO ]: Start isEmpty. Operand 79 states and 109 transitions. [2018-06-24 20:55:14,001 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:55:14,001 INFO ]: Found error trace [2018-06-24 20:55:14,001 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:14,001 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:14,001 INFO ]: Analyzing trace with hash 1601062123, now seen corresponding path program 8 times [2018-06-24 20:55:14,001 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:14,001 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:14,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:14,002 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:14,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:14,013 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:14,167 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:14,167 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:14,167 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-24 20:55:14,189 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:14,222 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:14,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:14,224 INFO ]: Computing forward predicates... [2018-06-24 20:55:14,311 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:14,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:14,330 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-24 20:55:14,330 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:14,330 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:14,330 INFO ]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:14,330 INFO ]: Start difference. First operand 79 states and 109 transitions. Second operand 17 states. [2018-06-24 20:55:14,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:14,466 INFO ]: Finished difference Result 138 states and 181 transitions. [2018-06-24 20:55:14,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:55:14,466 INFO ]: Start accepts. Automaton has 17 states. Word has length 15 [2018-06-24 20:55:14,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:14,466 INFO ]: With dead ends: 138 [2018-06-24 20:55:14,466 INFO ]: Without dead ends: 131 [2018-06-24 20:55:14,467 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:55:14,467 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-24 20:55:14,468 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 86. [2018-06-24 20:55:14,468 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 20:55:14,469 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2018-06-24 20:55:14,469 INFO ]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 15 [2018-06-24 20:55:14,469 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:14,469 INFO ]: Abstraction has 86 states and 118 transitions. [2018-06-24 20:55:14,469 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:14,469 INFO ]: Start isEmpty. Operand 86 states and 118 transitions. [2018-06-24 20:55:14,469 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:55:14,469 INFO ]: Found error trace [2018-06-24 20:55:14,469 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:14,469 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:14,469 INFO ]: Analyzing trace with hash 675359639, now seen corresponding path program 9 times [2018-06-24 20:55:14,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:14,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:14,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:14,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:14,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:14,475 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:15,782 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:15,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:15,782 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-24 20:55:15,788 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:15,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:55:15,817 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:15,819 INFO ]: Computing forward predicates... [2018-06-24 20:55:15,874 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:15,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:15,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:55:15,894 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:55:15,894 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:55:15,894 INFO ]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:55:15,894 INFO ]: Start difference. First operand 86 states and 118 transitions. Second operand 18 states. [2018-06-24 20:55:16,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:16,146 INFO ]: Finished difference Result 138 states and 179 transitions. [2018-06-24 20:55:16,146 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:55:16,146 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-24 20:55:16,146 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:16,147 INFO ]: With dead ends: 138 [2018-06-24 20:55:16,147 INFO ]: Without dead ends: 123 [2018-06-24 20:55:16,147 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:55:16,147 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-24 20:55:16,149 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 87. [2018-06-24 20:55:16,149 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 20:55:16,149 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2018-06-24 20:55:16,150 INFO ]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 15 [2018-06-24 20:55:16,150 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:16,150 INFO ]: Abstraction has 87 states and 117 transitions. [2018-06-24 20:55:16,150 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:55:16,150 INFO ]: Start isEmpty. Operand 87 states and 117 transitions. [2018-06-24 20:55:16,150 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:55:16,150 INFO ]: Found error trace [2018-06-24 20:55:16,150 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:16,150 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:16,150 INFO ]: Analyzing trace with hash -984357000, now seen corresponding path program 8 times [2018-06-24 20:55:16,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:16,150 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:16,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:16,154 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:16,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:16,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:16,430 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:16,430 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:16,430 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-24 20:55:16,435 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:16,464 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:16,464 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:16,466 INFO ]: Computing forward predicates... [2018-06-24 20:55:16,626 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:16,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:16,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-06-24 20:55:16,645 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:16,645 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:16,645 INFO ]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:16,645 INFO ]: Start difference. First operand 87 states and 117 transitions. Second operand 15 states. [2018-06-24 20:55:16,746 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:16,746 INFO ]: Finished difference Result 136 states and 181 transitions. [2018-06-24 20:55:16,746 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:55:16,746 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-24 20:55:16,746 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:16,747 INFO ]: With dead ends: 136 [2018-06-24 20:55:16,747 INFO ]: Without dead ends: 136 [2018-06-24 20:55:16,747 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:16,747 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-24 20:55:16,750 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 98. [2018-06-24 20:55:16,750 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-24 20:55:16,750 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2018-06-24 20:55:16,750 INFO ]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 15 [2018-06-24 20:55:16,750 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:16,750 INFO ]: Abstraction has 98 states and 132 transitions. [2018-06-24 20:55:16,750 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:16,750 INFO ]: Start isEmpty. Operand 98 states and 132 transitions. [2018-06-24 20:55:16,751 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:55:16,751 INFO ]: Found error trace [2018-06-24 20:55:16,751 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:16,751 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:16,751 INFO ]: Analyzing trace with hash -295206654, now seen corresponding path program 9 times [2018-06-24 20:55:16,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:16,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:16,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:16,752 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:16,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:16,757 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:17,660 INFO ]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:17,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:17,660 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-24 20:55:17,671 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:17,700 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:55:17,700 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:17,702 INFO ]: Computing forward predicates... [2018-06-24 20:55:17,742 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:17,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:17,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2018-06-24 20:55:17,760 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:55:17,760 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:55:17,760 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:55:17,761 INFO ]: Start difference. First operand 98 states and 132 transitions. Second operand 16 states. [2018-06-24 20:55:17,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:17,970 INFO ]: Finished difference Result 145 states and 190 transitions. [2018-06-24 20:55:17,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:55:17,970 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-24 20:55:17,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:17,970 INFO ]: With dead ends: 145 [2018-06-24 20:55:17,970 INFO ]: Without dead ends: 139 [2018-06-24 20:55:17,971 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:55:17,971 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-24 20:55:17,973 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 100. [2018-06-24 20:55:17,974 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 20:55:17,976 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2018-06-24 20:55:17,976 INFO ]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 15 [2018-06-24 20:55:17,976 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:17,976 INFO ]: Abstraction has 100 states and 134 transitions. [2018-06-24 20:55:17,976 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:55:17,976 INFO ]: Start isEmpty. Operand 100 states and 134 transitions. [2018-06-24 20:55:17,976 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:17,976 INFO ]: Found error trace [2018-06-24 20:55:17,977 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:17,977 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:17,977 INFO ]: Analyzing trace with hash -983148123, now seen corresponding path program 11 times [2018-06-24 20:55:17,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:17,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:17,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:17,977 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:17,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:17,983 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:18,102 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:18,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:18,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:18,110 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:18,142 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:55:18,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:18,143 INFO ]: Computing forward predicates... [2018-06-24 20:55:18,217 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:18,238 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:18,238 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:55:18,239 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:55:18,239 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:55:18,239 INFO ]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:55:18,239 INFO ]: Start difference. First operand 100 states and 134 transitions. Second operand 18 states. [2018-06-24 20:55:18,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:18,356 INFO ]: Finished difference Result 206 states and 262 transitions. [2018-06-24 20:55:18,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:55:18,357 INFO ]: Start accepts. Automaton has 18 states. Word has length 16 [2018-06-24 20:55:18,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:18,358 INFO ]: With dead ends: 206 [2018-06-24 20:55:18,358 INFO ]: Without dead ends: 206 [2018-06-24 20:55:18,358 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:18,358 INFO ]: Start minimizeSevpa. Operand 206 states. [2018-06-24 20:55:18,361 INFO ]: Finished minimizeSevpa. Reduced states from 206 to 93. [2018-06-24 20:55:18,361 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-24 20:55:18,361 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2018-06-24 20:55:18,361 INFO ]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 16 [2018-06-24 20:55:18,362 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:18,362 INFO ]: Abstraction has 93 states and 123 transitions. [2018-06-24 20:55:18,362 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:55:18,362 INFO ]: Start isEmpty. Operand 93 states and 123 transitions. [2018-06-24 20:55:18,362 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:18,362 INFO ]: Found error trace [2018-06-24 20:55:18,362 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:18,362 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:18,362 INFO ]: Analyzing trace with hash -1908850607, now seen corresponding path program 12 times [2018-06-24 20:55:18,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:18,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:18,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:18,363 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:18,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:18,368 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:18,706 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:18,706 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:18,706 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:18,711 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:18,747 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:55:18,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:18,749 INFO ]: Computing forward predicates... [2018-06-24 20:55:18,808 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:18,826 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:18,826 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-24 20:55:18,826 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:18,827 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:18,827 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:18,827 INFO ]: Start difference. First operand 93 states and 123 transitions. Second operand 19 states. [2018-06-24 20:55:19,356 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 20:55:19,596 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:19,596 INFO ]: Finished difference Result 207 states and 261 transitions. [2018-06-24 20:55:19,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:55:19,598 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-24 20:55:19,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:19,599 INFO ]: With dead ends: 207 [2018-06-24 20:55:19,599 INFO ]: Without dead ends: 200 [2018-06-24 20:55:19,599 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:55:19,599 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-24 20:55:19,604 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 100. [2018-06-24 20:55:19,604 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 20:55:19,604 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2018-06-24 20:55:19,604 INFO ]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 16 [2018-06-24 20:55:19,605 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:19,605 INFO ]: Abstraction has 100 states and 133 transitions. [2018-06-24 20:55:19,605 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:19,605 INFO ]: Start isEmpty. Operand 100 states and 133 transitions. [2018-06-24 20:55:19,605 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:19,605 INFO ]: Found error trace [2018-06-24 20:55:19,605 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:19,605 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:19,605 INFO ]: Analyzing trace with hash -1908791986, now seen corresponding path program 10 times [2018-06-24 20:55:19,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:19,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:19,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:19,606 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:19,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:19,613 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:20,176 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:20,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:20,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:20,182 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:20,212 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:20,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:20,214 INFO ]: Computing forward predicates... [2018-06-24 20:55:20,320 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:20,339 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:20,339 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-06-24 20:55:20,339 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:55:20,339 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:55:20,339 INFO ]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:55:20,339 INFO ]: Start difference. First operand 100 states and 133 transitions. Second operand 22 states. [2018-06-24 20:55:20,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:20,848 INFO ]: Finished difference Result 189 states and 235 transitions. [2018-06-24 20:55:20,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:55:20,848 INFO ]: Start accepts. Automaton has 22 states. Word has length 16 [2018-06-24 20:55:20,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:20,849 INFO ]: With dead ends: 189 [2018-06-24 20:55:20,849 INFO ]: Without dead ends: 188 [2018-06-24 20:55:20,849 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:55:20,849 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-24 20:55:20,852 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 101. [2018-06-24 20:55:20,852 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-24 20:55:20,859 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2018-06-24 20:55:20,859 INFO ]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 16 [2018-06-24 20:55:20,859 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:20,859 INFO ]: Abstraction has 101 states and 134 transitions. [2018-06-24 20:55:20,859 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:55:20,859 INFO ]: Start isEmpty. Operand 101 states and 134 transitions. [2018-06-24 20:55:20,860 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:20,860 INFO ]: Found error trace [2018-06-24 20:55:20,860 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:20,860 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:20,860 INFO ]: Analyzing trace with hash -1739088954, now seen corresponding path program 4 times [2018-06-24 20:55:20,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:20,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:20,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:20,862 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:20,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:20,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:21,535 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:21,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:21,535 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:21,540 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:21,570 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:21,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:21,572 INFO ]: Computing forward predicates... [2018-06-24 20:55:21,642 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:21,661 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:21,661 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:55:21,661 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:21,661 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:21,661 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:21,661 INFO ]: Start difference. First operand 101 states and 134 transitions. Second operand 15 states. [2018-06-24 20:55:21,965 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:21,965 INFO ]: Finished difference Result 154 states and 190 transitions. [2018-06-24 20:55:21,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:55:21,965 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:55:21,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:21,966 INFO ]: With dead ends: 154 [2018-06-24 20:55:21,966 INFO ]: Without dead ends: 148 [2018-06-24 20:55:21,966 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:55:21,966 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-24 20:55:21,968 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 97. [2018-06-24 20:55:21,968 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 20:55:21,968 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 129 transitions. [2018-06-24 20:55:21,969 INFO ]: Start accepts. Automaton has 97 states and 129 transitions. Word has length 16 [2018-06-24 20:55:21,969 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:21,969 INFO ]: Abstraction has 97 states and 129 transitions. [2018-06-24 20:55:21,969 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:21,969 INFO ]: Start isEmpty. Operand 97 states and 129 transitions. [2018-06-24 20:55:21,969 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:21,969 INFO ]: Found error trace [2018-06-24 20:55:21,969 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:21,969 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:21,969 INFO ]: Analyzing trace with hash -773262258, now seen corresponding path program 5 times [2018-06-24 20:55:21,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:21,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:21,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:21,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:21,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:21,979 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:22,196 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:22,196 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:22,196 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:22,201 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:22,233 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:22,233 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:22,235 INFO ]: Computing forward predicates... [2018-06-24 20:55:22,417 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:22,437 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:22,437 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:55:22,437 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:22,437 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:22,437 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:22,437 INFO ]: Start difference. First operand 97 states and 129 transitions. Second operand 15 states. [2018-06-24 20:55:22,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:22,757 INFO ]: Finished difference Result 141 states and 175 transitions. [2018-06-24 20:55:22,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:55:22,757 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:55:22,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:22,758 INFO ]: With dead ends: 141 [2018-06-24 20:55:22,758 INFO ]: Without dead ends: 135 [2018-06-24 20:55:22,758 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:55:22,758 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-24 20:55:22,761 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 97. [2018-06-24 20:55:22,761 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 20:55:22,761 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2018-06-24 20:55:22,761 INFO ]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 16 [2018-06-24 20:55:22,761 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:22,761 INFO ]: Abstraction has 97 states and 128 transitions. [2018-06-24 20:55:22,761 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:22,761 INFO ]: Start isEmpty. Operand 97 states and 128 transitions. [2018-06-24 20:55:22,761 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:22,761 INFO ]: Found error trace [2018-06-24 20:55:22,761 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:22,761 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:22,762 INFO ]: Analyzing trace with hash -897405754, now seen corresponding path program 6 times [2018-06-24 20:55:22,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:22,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:22,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:22,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:22,770 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:23,551 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:23,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:23,551 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:55:23,563 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:23,636 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:55:23,636 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:23,639 INFO ]: Computing forward predicates... [2018-06-24 20:55:23,680 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:23,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:23,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:55:23,698 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:23,698 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:23,699 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:23,699 INFO ]: Start difference. First operand 97 states and 128 transitions. Second operand 15 states. [2018-06-24 20:55:23,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:23,966 INFO ]: Finished difference Result 119 states and 151 transitions. [2018-06-24 20:55:23,966 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:55:23,966 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:55:23,966 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:23,967 INFO ]: With dead ends: 119 [2018-06-24 20:55:23,967 INFO ]: Without dead ends: 113 [2018-06-24 20:55:23,967 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:55:23,967 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-24 20:55:23,969 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 97. [2018-06-24 20:55:23,969 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 20:55:23,969 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2018-06-24 20:55:23,969 INFO ]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 16 [2018-06-24 20:55:23,969 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:23,969 INFO ]: Abstraction has 97 states and 127 transitions. [2018-06-24 20:55:23,969 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:23,969 INFO ]: Start isEmpty. Operand 97 states and 127 transitions. [2018-06-24 20:55:23,970 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:55:23,970 INFO ]: Found error trace [2018-06-24 20:55:23,970 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:23,970 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:23,970 INFO ]: Analyzing trace with hash -450886834, now seen corresponding path program 10 times [2018-06-24 20:55:23,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:23,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:23,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:23,970 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:23,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:23,978 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:24,520 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:24,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:24,520 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:24,527 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:24,558 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:24,558 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:24,560 INFO ]: Computing forward predicates... [2018-06-24 20:55:24,590 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:24,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:24,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:55:24,609 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:55:24,609 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:55:24,609 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:55:24,609 INFO ]: Start difference. First operand 97 states and 127 transitions. Second operand 15 states. [2018-06-24 20:55:25,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:25,131 INFO ]: Finished difference Result 114 states and 147 transitions. [2018-06-24 20:55:25,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:55:25,131 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:55:25,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:25,131 INFO ]: With dead ends: 114 [2018-06-24 20:55:25,131 INFO ]: Without dead ends: 114 [2018-06-24 20:55:25,132 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:55:25,132 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-24 20:55:25,135 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-06-24 20:55:25,135 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-24 20:55:25,135 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2018-06-24 20:55:25,135 INFO ]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 16 [2018-06-24 20:55:25,135 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:25,136 INFO ]: Abstraction has 100 states and 131 transitions. [2018-06-24 20:55:25,136 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:55:25,136 INFO ]: Start isEmpty. Operand 100 states and 131 transitions. [2018-06-24 20:55:25,136 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:55:25,136 INFO ]: Found error trace [2018-06-24 20:55:25,136 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:25,136 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:25,136 INFO ]: Analyzing trace with hash -413172358, now seen corresponding path program 13 times [2018-06-24 20:55:25,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:25,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:25,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:25,137 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:25,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:25,147 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:25,412 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:25,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:25,412 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:25,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:25,450 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:25,452 INFO ]: Computing forward predicates... [2018-06-24 20:55:25,585 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:25,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:25,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-24 20:55:25,606 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:55:25,606 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:55:25,606 INFO ]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:55:25,606 INFO ]: Start difference. First operand 100 states and 131 transitions. Second operand 23 states. [2018-06-24 20:55:25,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:25,926 INFO ]: Finished difference Result 234 states and 296 transitions. [2018-06-24 20:55:25,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:55:25,926 INFO ]: Start accepts. Automaton has 23 states. Word has length 17 [2018-06-24 20:55:25,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:25,927 INFO ]: With dead ends: 234 [2018-06-24 20:55:25,927 INFO ]: Without dead ends: 234 [2018-06-24 20:55:25,927 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:55:25,927 INFO ]: Start minimizeSevpa. Operand 234 states. [2018-06-24 20:55:25,931 INFO ]: Finished minimizeSevpa. Reduced states from 234 to 109. [2018-06-24 20:55:25,931 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-24 20:55:25,932 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2018-06-24 20:55:25,932 INFO ]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 17 [2018-06-24 20:55:25,932 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:25,932 INFO ]: Abstraction has 109 states and 145 transitions. [2018-06-24 20:55:25,932 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:55:25,932 INFO ]: Start isEmpty. Operand 109 states and 145 transitions. [2018-06-24 20:55:25,932 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:55:25,932 INFO ]: Found error trace [2018-06-24 20:55:25,932 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:25,932 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:25,932 INFO ]: Analyzing trace with hash -413113737, now seen corresponding path program 11 times [2018-06-24 20:55:25,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:25,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:25,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:25,933 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:25,933 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:25,939 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:26,130 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:26,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:26,130 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:26,137 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:26,176 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:55:26,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:26,178 INFO ]: Computing forward predicates... [2018-06-24 20:55:26,253 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:26,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:26,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-24 20:55:26,272 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:55:26,272 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:55:26,272 INFO ]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:26,272 INFO ]: Start difference. First operand 109 states and 145 transitions. Second operand 20 states. [2018-06-24 20:55:26,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:26,437 INFO ]: Finished difference Result 203 states and 256 transitions. [2018-06-24 20:55:26,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:55:26,437 INFO ]: Start accepts. Automaton has 20 states. Word has length 17 [2018-06-24 20:55:26,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:26,437 INFO ]: With dead ends: 203 [2018-06-24 20:55:26,437 INFO ]: Without dead ends: 194 [2018-06-24 20:55:26,438 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:55:26,438 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-24 20:55:26,439 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 118. [2018-06-24 20:55:26,439 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-24 20:55:26,440 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 157 transitions. [2018-06-24 20:55:26,440 INFO ]: Start accepts. Automaton has 118 states and 157 transitions. Word has length 17 [2018-06-24 20:55:26,440 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:26,440 INFO ]: Abstraction has 118 states and 157 transitions. [2018-06-24 20:55:26,440 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:55:26,440 INFO ]: Start isEmpty. Operand 118 states and 157 transitions. [2018-06-24 20:55:26,440 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:55:26,440 INFO ]: Found error trace [2018-06-24 20:55:26,440 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:26,440 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:26,440 INFO ]: Analyzing trace with hash 954880331, now seen corresponding path program 12 times [2018-06-24 20:55:26,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:26,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:26,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:26,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:26,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:26,445 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:26,559 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:26,559 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:26,559 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:26,564 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:26,598 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:55:26,598 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:26,600 INFO ]: Computing forward predicates... [2018-06-24 20:55:26,829 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:26,847 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:26,847 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:55:26,848 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:55:26,848 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:55:26,848 INFO ]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:55:26,848 INFO ]: Start difference. First operand 118 states and 157 transitions. Second operand 21 states. [2018-06-24 20:55:27,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:27,122 INFO ]: Finished difference Result 203 states and 254 transitions. [2018-06-24 20:55:27,124 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:55:27,124 INFO ]: Start accepts. Automaton has 21 states. Word has length 17 [2018-06-24 20:55:27,124 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:27,125 INFO ]: With dead ends: 203 [2018-06-24 20:55:27,125 INFO ]: Without dead ends: 184 [2018-06-24 20:55:27,125 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=1406, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:55:27,126 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-24 20:55:27,128 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 120. [2018-06-24 20:55:27,128 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-24 20:55:27,129 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2018-06-24 20:55:27,129 INFO ]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 17 [2018-06-24 20:55:27,129 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:27,129 INFO ]: Abstraction has 120 states and 157 transitions. [2018-06-24 20:55:27,129 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:55:27,129 INFO ]: Start isEmpty. Operand 120 states and 157 transitions. [2018-06-24 20:55:27,129 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:55:27,129 INFO ]: Found error trace [2018-06-24 20:55:27,129 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:27,129 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:27,129 INFO ]: Analyzing trace with hash -982005118, now seen corresponding path program 11 times [2018-06-24 20:55:27,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:27,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:27,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:27,130 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:27,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:27,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:27,222 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:27,222 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:27,222 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:27,227 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:27,292 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:55:27,292 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:27,295 INFO ]: Computing forward predicates... [2018-06-24 20:55:27,340 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:27,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:27,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-06-24 20:55:27,359 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:55:27,359 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:55:27,359 INFO ]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:55:27,359 INFO ]: Start difference. First operand 120 states and 157 transitions. Second operand 18 states. [2018-06-24 20:55:27,474 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:27,474 INFO ]: Finished difference Result 189 states and 245 transitions. [2018-06-24 20:55:27,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:55:27,474 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-24 20:55:27,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:27,475 INFO ]: With dead ends: 189 [2018-06-24 20:55:27,475 INFO ]: Without dead ends: 189 [2018-06-24 20:55:27,475 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:27,475 INFO ]: Start minimizeSevpa. Operand 189 states. [2018-06-24 20:55:27,477 INFO ]: Finished minimizeSevpa. Reduced states from 189 to 134. [2018-06-24 20:55:27,477 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:55:27,477 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2018-06-24 20:55:27,477 INFO ]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 17 [2018-06-24 20:55:27,477 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:27,477 INFO ]: Abstraction has 134 states and 176 transitions. [2018-06-24 20:55:27,477 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:55:27,477 INFO ]: Start isEmpty. Operand 134 states and 176 transitions. [2018-06-24 20:55:27,478 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:55:27,478 INFO ]: Found error trace [2018-06-24 20:55:27,478 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:27,478 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:27,478 INFO ]: Analyzing trace with hash -1093180872, now seen corresponding path program 12 times [2018-06-24 20:55:27,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:27,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:27,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:27,479 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:27,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:27,486 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:28,382 INFO ]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:28,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:28,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:28,388 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:28,422 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:55:28,422 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:28,424 INFO ]: Computing forward predicates... [2018-06-24 20:55:28,482 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:28,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:28,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2018-06-24 20:55:28,502 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:28,502 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:28,502 INFO ]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:28,502 INFO ]: Start difference. First operand 134 states and 176 transitions. Second operand 19 states. [2018-06-24 20:55:28,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:28,797 INFO ]: Finished difference Result 200 states and 256 transitions. [2018-06-24 20:55:28,797 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:55:28,797 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-24 20:55:28,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:28,798 INFO ]: With dead ends: 200 [2018-06-24 20:55:28,798 INFO ]: Without dead ends: 193 [2018-06-24 20:55:28,798 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:55:28,798 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-24 20:55:28,801 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 136. [2018-06-24 20:55:28,801 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:55:28,802 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2018-06-24 20:55:28,802 INFO ]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 17 [2018-06-24 20:55:28,802 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:28,802 INFO ]: Abstraction has 136 states and 178 transitions. [2018-06-24 20:55:28,802 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:28,802 INFO ]: Start isEmpty. Operand 136 states and 178 transitions. [2018-06-24 20:55:28,803 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:28,803 INFO ]: Found error trace [2018-06-24 20:55:28,803 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:28,803 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:28,803 INFO ]: Analyzing trace with hash -1291786895, now seen corresponding path program 14 times [2018-06-24 20:55:28,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:28,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:28,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:28,804 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:28,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:28,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:29,055 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:29,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:29,055 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:29,061 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:29,095 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:29,095 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:29,097 INFO ]: Computing forward predicates... [2018-06-24 20:55:29,191 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:29,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:29,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:55:29,210 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:55:29,211 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:55:29,211 INFO ]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:55:29,211 INFO ]: Start difference. First operand 136 states and 178 transitions. Second operand 21 states. [2018-06-24 20:55:29,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:29,400 INFO ]: Finished difference Result 294 states and 362 transitions. [2018-06-24 20:55:29,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:55:29,401 INFO ]: Start accepts. Automaton has 21 states. Word has length 18 [2018-06-24 20:55:29,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:29,401 INFO ]: With dead ends: 294 [2018-06-24 20:55:29,401 INFO ]: Without dead ends: 294 [2018-06-24 20:55:29,401 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:55:29,402 INFO ]: Start minimizeSevpa. Operand 294 states. [2018-06-24 20:55:29,405 INFO ]: Finished minimizeSevpa. Reduced states from 294 to 128. [2018-06-24 20:55:29,405 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-24 20:55:29,405 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 166 transitions. [2018-06-24 20:55:29,405 INFO ]: Start accepts. Automaton has 128 states and 166 transitions. Word has length 18 [2018-06-24 20:55:29,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:29,405 INFO ]: Abstraction has 128 states and 166 transitions. [2018-06-24 20:55:29,405 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:55:29,405 INFO ]: Start isEmpty. Operand 128 states and 166 transitions. [2018-06-24 20:55:29,406 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:29,406 INFO ]: Found error trace [2018-06-24 20:55:29,406 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:29,406 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:29,406 INFO ]: Analyzing trace with hash 76207173, now seen corresponding path program 15 times [2018-06-24 20:55:29,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:29,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:29,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:29,407 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:29,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:29,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:29,519 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:29,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:29,519 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:29,525 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:29,562 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:55:29,562 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:29,564 INFO ]: Computing forward predicates... [2018-06-24 20:55:30,190 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:30,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:30,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-24 20:55:30,210 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:55:30,210 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:55:30,210 INFO ]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:55:30,210 INFO ]: Start difference. First operand 128 states and 166 transitions. Second operand 22 states. [2018-06-24 20:55:30,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:30,592 INFO ]: Finished difference Result 295 states and 361 transitions. [2018-06-24 20:55:30,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:55:30,592 INFO ]: Start accepts. Automaton has 22 states. Word has length 18 [2018-06-24 20:55:30,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:30,593 INFO ]: With dead ends: 295 [2018-06-24 20:55:30,593 INFO ]: Without dead ends: 287 [2018-06-24 20:55:30,593 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=557, Invalid=1893, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:55:30,593 INFO ]: Start minimizeSevpa. Operand 287 states. [2018-06-24 20:55:30,596 INFO ]: Finished minimizeSevpa. Reduced states from 287 to 136. [2018-06-24 20:55:30,596 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:55:30,596 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2018-06-24 20:55:30,596 INFO ]: Start accepts. Automaton has 136 states and 177 transitions. Word has length 18 [2018-06-24 20:55:30,596 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:30,596 INFO ]: Abstraction has 136 states and 177 transitions. [2018-06-24 20:55:30,596 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:55:30,596 INFO ]: Start isEmpty. Operand 136 states and 177 transitions. [2018-06-24 20:55:30,596 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:30,596 INFO ]: Found error trace [2018-06-24 20:55:30,597 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:30,597 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:30,597 INFO ]: Analyzing trace with hash 76265794, now seen corresponding path program 13 times [2018-06-24 20:55:30,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:30,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:30,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:30,597 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:30,597 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:30,604 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:31,375 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:31,375 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:31,375 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:31,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:31,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:31,419 INFO ]: Computing forward predicates... [2018-06-24 20:55:31,568 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:31,590 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:31,590 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-24 20:55:31,591 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:55:31,591 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:55:31,591 INFO ]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:55:31,591 INFO ]: Start difference. First operand 136 states and 177 transitions. Second operand 25 states. [2018-06-24 20:55:31,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:31,888 INFO ]: Finished difference Result 273 states and 330 transitions. [2018-06-24 20:55:31,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:55:31,888 INFO ]: Start accepts. Automaton has 25 states. Word has length 18 [2018-06-24 20:55:31,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:31,889 INFO ]: With dead ends: 273 [2018-06-24 20:55:31,889 INFO ]: Without dead ends: 272 [2018-06-24 20:55:31,889 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:55:31,889 INFO ]: Start minimizeSevpa. Operand 272 states. [2018-06-24 20:55:31,892 INFO ]: Finished minimizeSevpa. Reduced states from 272 to 137. [2018-06-24 20:55:31,892 INFO ]: Start removeUnreachable. Operand 137 states. [2018-06-24 20:55:31,892 INFO ]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2018-06-24 20:55:31,892 INFO ]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 18 [2018-06-24 20:55:31,892 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:31,892 INFO ]: Abstraction has 137 states and 178 transitions. [2018-06-24 20:55:31,892 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:55:31,892 INFO ]: Start isEmpty. Operand 137 states and 178 transitions. [2018-06-24 20:55:31,893 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:31,893 INFO ]: Found error trace [2018-06-24 20:55:31,893 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:31,893 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:31,893 INFO ]: Analyzing trace with hash 996512260, now seen corresponding path program 7 times [2018-06-24 20:55:31,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:31,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:31,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:31,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:31,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:31,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:32,133 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:32,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:32,133 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:32,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:32,175 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:32,178 INFO ]: Computing forward predicates... [2018-06-24 20:55:32,255 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:32,273 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:32,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:55:32,274 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:32,274 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:32,274 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:32,274 INFO ]: Start difference. First operand 137 states and 178 transitions. Second operand 17 states. [2018-06-24 20:55:32,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:32,610 INFO ]: Finished difference Result 225 states and 270 transitions. [2018-06-24 20:55:32,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:55:32,610 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:55:32,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:32,611 INFO ]: With dead ends: 225 [2018-06-24 20:55:32,611 INFO ]: Without dead ends: 218 [2018-06-24 20:55:32,611 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:55:32,611 INFO ]: Start minimizeSevpa. Operand 218 states. [2018-06-24 20:55:32,614 INFO ]: Finished minimizeSevpa. Reduced states from 218 to 132. [2018-06-24 20:55:32,614 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 20:55:32,614 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2018-06-24 20:55:32,614 INFO ]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 18 [2018-06-24 20:55:32,614 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:32,614 INFO ]: Abstraction has 132 states and 172 transitions. [2018-06-24 20:55:32,614 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:32,614 INFO ]: Start isEmpty. Operand 132 states and 172 transitions. [2018-06-24 20:55:32,614 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:32,615 INFO ]: Found error trace [2018-06-24 20:55:32,615 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:32,615 INFO ]: === Iteration 58 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:32,615 INFO ]: Analyzing trace with hash -540618366, now seen corresponding path program 8 times [2018-06-24 20:55:32,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:32,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:32,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:32,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:32,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:32,623 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:32,791 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:32,791 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:32,791 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:55:32,799 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:32,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:32,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:32,837 INFO ]: Computing forward predicates... [2018-06-24 20:55:32,876 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:32,895 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:32,895 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:55:32,895 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:32,895 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:32,895 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:32,895 INFO ]: Start difference. First operand 132 states and 172 transitions. Second operand 17 states. [2018-06-24 20:55:33,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:33,256 INFO ]: Finished difference Result 209 states and 252 transitions. [2018-06-24 20:55:33,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:55:33,256 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:55:33,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:33,257 INFO ]: With dead ends: 209 [2018-06-24 20:55:33,257 INFO ]: Without dead ends: 202 [2018-06-24 20:55:33,257 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:55:33,257 INFO ]: Start minimizeSevpa. Operand 202 states. [2018-06-24 20:55:33,260 INFO ]: Finished minimizeSevpa. Reduced states from 202 to 132. [2018-06-24 20:55:33,260 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 20:55:33,260 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-06-24 20:55:33,260 INFO ]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 18 [2018-06-24 20:55:33,260 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:33,260 INFO ]: Abstraction has 132 states and 171 transitions. [2018-06-24 20:55:33,260 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:33,260 INFO ]: Start isEmpty. Operand 132 states and 171 transitions. [2018-06-24 20:55:33,261 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:33,261 INFO ]: Found error trace [2018-06-24 20:55:33,261 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:33,261 INFO ]: === Iteration 59 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:33,261 INFO ]: Analyzing trace with hash -947027516, now seen corresponding path program 9 times [2018-06-24 20:55:33,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:33,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:33,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:33,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:33,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:33,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:33,446 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:33,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:33,446 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:33,451 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:33,490 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:55:33,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:33,492 INFO ]: Computing forward predicates... [2018-06-24 20:55:33,523 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:33,543 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:33,543 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:55:33,543 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:33,543 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:33,543 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:33,543 INFO ]: Start difference. First operand 132 states and 171 transitions. Second operand 17 states. [2018-06-24 20:55:33,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:33,905 INFO ]: Finished difference Result 182 states and 223 transitions. [2018-06-24 20:55:33,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:55:33,905 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:55:33,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:33,905 INFO ]: With dead ends: 182 [2018-06-24 20:55:33,905 INFO ]: Without dead ends: 175 [2018-06-24 20:55:33,905 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:55:33,905 INFO ]: Start minimizeSevpa. Operand 175 states. [2018-06-24 20:55:33,907 INFO ]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-06-24 20:55:33,907 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 20:55:33,907 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2018-06-24 20:55:33,907 INFO ]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 18 [2018-06-24 20:55:33,907 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:33,907 INFO ]: Abstraction has 132 states and 170 transitions. [2018-06-24 20:55:33,907 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:33,907 INFO ]: Start isEmpty. Operand 132 states and 170 transitions. [2018-06-24 20:55:33,908 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:33,908 INFO ]: Found error trace [2018-06-24 20:55:33,908 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:33,908 INFO ]: === Iteration 60 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:33,908 INFO ]: Analyzing trace with hash -660809278, now seen corresponding path program 10 times [2018-06-24 20:55:33,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:33,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:33,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:33,908 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:33,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:33,917 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:34,274 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:34,274 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:34,274 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:34,283 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:34,319 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:34,320 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:34,322 INFO ]: Computing forward predicates... [2018-06-24 20:55:34,360 INFO ]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:34,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:34,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:55:34,380 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:34,380 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:34,380 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:34,380 INFO ]: Start difference. First operand 132 states and 170 transitions. Second operand 17 states. [2018-06-24 20:55:34,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:34,749 INFO ]: Finished difference Result 157 states and 196 transitions. [2018-06-24 20:55:34,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:55:34,750 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:55:34,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:34,750 INFO ]: With dead ends: 157 [2018-06-24 20:55:34,750 INFO ]: Without dead ends: 150 [2018-06-24 20:55:34,750 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:55:34,750 INFO ]: Start minimizeSevpa. Operand 150 states. [2018-06-24 20:55:34,752 INFO ]: Finished minimizeSevpa. Reduced states from 150 to 132. [2018-06-24 20:55:34,752 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-24 20:55:34,752 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2018-06-24 20:55:34,752 INFO ]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 18 [2018-06-24 20:55:34,752 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:34,752 INFO ]: Abstraction has 132 states and 169 transitions. [2018-06-24 20:55:34,752 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:34,752 INFO ]: Start isEmpty. Operand 132 states and 169 transitions. [2018-06-24 20:55:34,752 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:55:34,752 INFO ]: Found error trace [2018-06-24 20:55:34,752 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:34,752 INFO ]: === Iteration 61 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:34,753 INFO ]: Analyzing trace with hash -377978492, now seen corresponding path program 13 times [2018-06-24 20:55:34,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:34,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:34,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:34,753 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:34,753 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:34,760 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:34,896 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:34,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:34,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:34,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:34,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:34,938 INFO ]: Computing forward predicates... [2018-06-24 20:55:34,971 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:34,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:34,991 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:55:34,992 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:55:34,992 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:55:34,992 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:55:34,992 INFO ]: Start difference. First operand 132 states and 169 transitions. Second operand 17 states. [2018-06-24 20:55:35,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:35,318 INFO ]: Finished difference Result 151 states and 191 transitions. [2018-06-24 20:55:35,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:55:35,318 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:55:35,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:35,318 INFO ]: With dead ends: 151 [2018-06-24 20:55:35,318 INFO ]: Without dead ends: 151 [2018-06-24 20:55:35,318 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:55:35,318 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-24 20:55:35,320 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-06-24 20:55:35,320 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-24 20:55:35,320 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2018-06-24 20:55:35,320 INFO ]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 18 [2018-06-24 20:55:35,320 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:35,320 INFO ]: Abstraction has 135 states and 173 transitions. [2018-06-24 20:55:35,320 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:55:35,320 INFO ]: Start isEmpty. Operand 135 states and 173 transitions. [2018-06-24 20:55:35,320 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:55:35,320 INFO ]: Found error trace [2018-06-24 20:55:35,320 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:35,320 INFO ]: === Iteration 62 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:35,320 INFO ]: Analyzing trace with hash -1391039698, now seen corresponding path program 16 times [2018-06-24 20:55:35,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:35,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:35,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:35,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:35,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:35,327 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:35,468 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:35,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:35,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:35,474 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:35,510 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:35,510 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:35,513 INFO ]: Computing forward predicates... [2018-06-24 20:55:35,661 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:35,679 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:35,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-24 20:55:35,680 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:55:35,680 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:55:35,680 INFO ]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:55:35,680 INFO ]: Start difference. First operand 135 states and 173 transitions. Second operand 26 states. [2018-06-24 20:55:36,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:36,042 INFO ]: Finished difference Result 327 states and 401 transitions. [2018-06-24 20:55:36,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:55:36,042 INFO ]: Start accepts. Automaton has 26 states. Word has length 19 [2018-06-24 20:55:36,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:36,042 INFO ]: With dead ends: 327 [2018-06-24 20:55:36,042 INFO ]: Without dead ends: 327 [2018-06-24 20:55:36,043 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=1093, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:55:36,043 INFO ]: Start minimizeSevpa. Operand 327 states. [2018-06-24 20:55:36,045 INFO ]: Finished minimizeSevpa. Reduced states from 327 to 145. [2018-06-24 20:55:36,045 INFO ]: Start removeUnreachable. Operand 145 states. [2018-06-24 20:55:36,046 INFO ]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2018-06-24 20:55:36,046 INFO ]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 19 [2018-06-24 20:55:36,046 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:36,046 INFO ]: Abstraction has 145 states and 188 transitions. [2018-06-24 20:55:36,046 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:55:36,046 INFO ]: Start isEmpty. Operand 145 states and 188 transitions. [2018-06-24 20:55:36,046 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:55:36,046 INFO ]: Found error trace [2018-06-24 20:55:36,046 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:36,046 INFO ]: === Iteration 63 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:36,046 INFO ]: Analyzing trace with hash -1390981077, now seen corresponding path program 14 times [2018-06-24 20:55:36,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:36,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:36,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:36,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:36,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:36,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:36,266 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:36,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:36,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:36,273 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:36,309 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:36,309 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:36,311 INFO ]: Computing forward predicates... [2018-06-24 20:55:36,404 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:36,423 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:36,423 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-24 20:55:36,423 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:55:36,423 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:55:36,423 INFO ]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:55:36,423 INFO ]: Start difference. First operand 145 states and 188 transitions. Second operand 23 states. [2018-06-24 20:55:36,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:36,589 INFO ]: Finished difference Result 286 states and 350 transitions. [2018-06-24 20:55:36,590 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:55:36,590 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-24 20:55:36,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:36,590 INFO ]: With dead ends: 286 [2018-06-24 20:55:36,590 INFO ]: Without dead ends: 275 [2018-06-24 20:55:36,590 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:55:36,591 INFO ]: Start minimizeSevpa. Operand 275 states. [2018-06-24 20:55:36,592 INFO ]: Finished minimizeSevpa. Reduced states from 275 to 156. [2018-06-24 20:55:36,593 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-24 20:55:36,593 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-06-24 20:55:36,593 INFO ]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 19 [2018-06-24 20:55:36,593 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:36,593 INFO ]: Abstraction has 156 states and 203 transitions. [2018-06-24 20:55:36,593 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:55:36,593 INFO ]: Start isEmpty. Operand 156 states and 203 transitions. [2018-06-24 20:55:36,593 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:55:36,593 INFO ]: Found error trace [2018-06-24 20:55:36,593 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:36,593 INFO ]: === Iteration 64 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:36,593 INFO ]: Analyzing trace with hash -1932837929, now seen corresponding path program 15 times [2018-06-24 20:55:36,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:36,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:36,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:36,596 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:36,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:36,603 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:36,786 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:36,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:36,786 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:36,800 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:36,841 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:55:36,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:36,843 INFO ]: Computing forward predicates... [2018-06-24 20:55:38,017 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:38,035 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:38,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-24 20:55:38,035 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:55:38,035 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:55:38,035 INFO ]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:38,035 INFO ]: Start difference. First operand 156 states and 203 transitions. Second operand 24 states. [2018-06-24 20:55:38,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:38,430 INFO ]: Finished difference Result 286 states and 348 transitions. [2018-06-24 20:55:38,433 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:55:38,433 INFO ]: Start accepts. Automaton has 24 states. Word has length 19 [2018-06-24 20:55:38,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:38,434 INFO ]: With dead ends: 286 [2018-06-24 20:55:38,434 INFO ]: Without dead ends: 263 [2018-06-24 20:55:38,434 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:55:38,434 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-24 20:55:38,438 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 159. [2018-06-24 20:55:38,438 INFO ]: Start removeUnreachable. Operand 159 states. [2018-06-24 20:55:38,439 INFO ]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2018-06-24 20:55:38,439 INFO ]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 19 [2018-06-24 20:55:38,439 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:38,439 INFO ]: Abstraction has 159 states and 204 transitions. [2018-06-24 20:55:38,439 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:55:38,439 INFO ]: Start isEmpty. Operand 159 states and 204 transitions. [2018-06-24 20:55:38,439 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:55:38,439 INFO ]: Found error trace [2018-06-24 20:55:38,439 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:38,439 INFO ]: === Iteration 65 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:38,439 INFO ]: Analyzing trace with hash 318458808, now seen corresponding path program 14 times [2018-06-24 20:55:38,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:38,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:38,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:38,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:38,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:38,447 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:38,632 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:38,632 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:38,632 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:38,638 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:38,677 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:38,677 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:38,680 INFO ]: Computing forward predicates... [2018-06-24 20:55:38,736 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:38,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:38,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2018-06-24 20:55:38,755 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:55:38,755 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:55:38,755 INFO ]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:55:38,755 INFO ]: Start difference. First operand 159 states and 204 transitions. Second operand 21 states. [2018-06-24 20:55:38,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:38,890 INFO ]: Finished difference Result 251 states and 319 transitions. [2018-06-24 20:55:38,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:55:38,890 INFO ]: Start accepts. Automaton has 21 states. Word has length 19 [2018-06-24 20:55:38,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:38,891 INFO ]: With dead ends: 251 [2018-06-24 20:55:38,891 INFO ]: Without dead ends: 251 [2018-06-24 20:55:38,891 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:55:38,891 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-24 20:55:38,893 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 176. [2018-06-24 20:55:38,893 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-24 20:55:38,894 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2018-06-24 20:55:38,894 INFO ]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 19 [2018-06-24 20:55:38,894 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:38,894 INFO ]: Abstraction has 176 states and 227 transitions. [2018-06-24 20:55:38,894 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:55:38,894 INFO ]: Start isEmpty. Operand 176 states and 227 transitions. [2018-06-24 20:55:38,894 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:55:38,894 INFO ]: Found error trace [2018-06-24 20:55:38,894 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:38,894 INFO ]: === Iteration 66 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:38,895 INFO ]: Analyzing trace with hash 1166977730, now seen corresponding path program 15 times [2018-06-24 20:55:38,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:38,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:38,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:38,895 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:38,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:38,901 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:39,071 INFO ]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:39,072 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:39,072 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:39,077 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:39,117 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:55:39,117 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:39,119 INFO ]: Computing forward predicates... [2018-06-24 20:55:39,194 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:39,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:39,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2018-06-24 20:55:39,213 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:55:39,213 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:55:39,213 INFO ]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:55:39,213 INFO ]: Start difference. First operand 176 states and 227 transitions. Second operand 22 states. [2018-06-24 20:55:39,656 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:39,656 INFO ]: Finished difference Result 264 states and 332 transitions. [2018-06-24 20:55:39,656 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 20:55:39,656 INFO ]: Start accepts. Automaton has 22 states. Word has length 19 [2018-06-24 20:55:39,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:39,657 INFO ]: With dead ends: 264 [2018-06-24 20:55:39,657 INFO ]: Without dead ends: 256 [2018-06-24 20:55:39,657 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=702, Invalid=2268, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:55:39,657 INFO ]: Start minimizeSevpa. Operand 256 states. [2018-06-24 20:55:39,660 INFO ]: Finished minimizeSevpa. Reduced states from 256 to 178. [2018-06-24 20:55:39,660 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-24 20:55:39,660 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 229 transitions. [2018-06-24 20:55:39,660 INFO ]: Start accepts. Automaton has 178 states and 229 transitions. Word has length 19 [2018-06-24 20:55:39,660 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:39,660 INFO ]: Abstraction has 178 states and 229 transitions. [2018-06-24 20:55:39,660 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:55:39,660 INFO ]: Start isEmpty. Operand 178 states and 229 transitions. [2018-06-24 20:55:39,661 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:39,661 INFO ]: Found error trace [2018-06-24 20:55:39,661 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:39,661 INFO ]: === Iteration 67 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:39,661 INFO ]: Analyzing trace with hash 368947557, now seen corresponding path program 17 times [2018-06-24 20:55:39,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:39,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:39,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:39,661 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:39,661 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:39,665 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:39,890 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:39,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:39,891 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:39,898 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:39,940 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:55:39,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:39,942 INFO ]: Computing forward predicates... [2018-06-24 20:55:40,244 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:40,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:40,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-06-24 20:55:40,263 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:55:40,263 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:55:40,263 INFO ]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:55:40,263 INFO ]: Start difference. First operand 178 states and 229 transitions. Second operand 24 states. [2018-06-24 20:55:40,480 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:40,480 INFO ]: Finished difference Result 403 states and 484 transitions. [2018-06-24 20:55:40,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:55:40,480 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-24 20:55:40,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:40,481 INFO ]: With dead ends: 403 [2018-06-24 20:55:40,481 INFO ]: Without dead ends: 403 [2018-06-24 20:55:40,481 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:55:40,481 INFO ]: Start minimizeSevpa. Operand 403 states. [2018-06-24 20:55:40,483 INFO ]: Finished minimizeSevpa. Reduced states from 403 to 169. [2018-06-24 20:55:40,483 INFO ]: Start removeUnreachable. Operand 169 states. [2018-06-24 20:55:40,483 INFO ]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2018-06-24 20:55:40,483 INFO ]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 20 [2018-06-24 20:55:40,483 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:40,483 INFO ]: Abstraction has 169 states and 216 transitions. [2018-06-24 20:55:40,483 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:55:40,483 INFO ]: Start isEmpty. Operand 169 states and 216 transitions. [2018-06-24 20:55:40,484 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:40,484 INFO ]: Found error trace [2018-06-24 20:55:40,484 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:40,484 INFO ]: === Iteration 68 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:40,484 INFO ]: Analyzing trace with hash -172909295, now seen corresponding path program 18 times [2018-06-24 20:55:40,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:40,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:40,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:40,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:40,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:40,489 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:41,154 INFO ]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:41,155 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:41,155 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:41,162 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:41,226 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:55:41,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:41,228 INFO ]: Computing forward predicates... [2018-06-24 20:55:41,482 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:41,514 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:41,514 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-06-24 20:55:41,514 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:55:41,514 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:55:41,514 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:55:41,514 INFO ]: Start difference. First operand 169 states and 216 transitions. Second operand 25 states. [2018-06-24 20:55:42,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:42,058 INFO ]: Finished difference Result 404 states and 483 transitions. [2018-06-24 20:55:42,058 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:55:42,058 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-24 20:55:42,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:42,059 INFO ]: With dead ends: 404 [2018-06-24 20:55:42,059 INFO ]: Without dead ends: 395 [2018-06-24 20:55:42,059 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2018-06-24 20:55:42,060 INFO ]: Start minimizeSevpa. Operand 395 states. [2018-06-24 20:55:42,061 INFO ]: Finished minimizeSevpa. Reduced states from 395 to 178. [2018-06-24 20:55:42,061 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-24 20:55:42,062 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 228 transitions. [2018-06-24 20:55:42,062 INFO ]: Start accepts. Automaton has 178 states and 228 transitions. Word has length 20 [2018-06-24 20:55:42,062 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:42,062 INFO ]: Abstraction has 178 states and 228 transitions. [2018-06-24 20:55:42,062 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:55:42,062 INFO ]: Start isEmpty. Operand 178 states and 228 transitions. [2018-06-24 20:55:42,062 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:42,062 INFO ]: Found error trace [2018-06-24 20:55:42,062 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:42,062 INFO ]: === Iteration 69 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:42,062 INFO ]: Analyzing trace with hash -172850674, now seen corresponding path program 16 times [2018-06-24 20:55:42,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:42,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:42,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:42,062 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:42,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:42,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:42,365 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:42,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:42,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:42,372 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:42,409 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:42,410 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:42,412 INFO ]: Computing forward predicates... [2018-06-24 20:55:42,536 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:42,553 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:42,554 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-24 20:55:42,554 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:55:42,554 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:55:42,554 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:55:42,554 INFO ]: Start difference. First operand 178 states and 228 transitions. Second operand 20 states. [2018-06-24 20:55:42,934 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:42,934 INFO ]: Finished difference Result 378 states and 447 transitions. [2018-06-24 20:55:42,934 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:55:42,934 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-24 20:55:42,934 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:42,935 INFO ]: With dead ends: 378 [2018-06-24 20:55:42,935 INFO ]: Without dead ends: 377 [2018-06-24 20:55:42,935 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:55:42,935 INFO ]: Start minimizeSevpa. Operand 377 states. [2018-06-24 20:55:42,937 INFO ]: Finished minimizeSevpa. Reduced states from 377 to 179. [2018-06-24 20:55:42,937 INFO ]: Start removeUnreachable. Operand 179 states. [2018-06-24 20:55:42,938 INFO ]: Finished removeUnreachable. Reduced from 179 states to 179 states and 229 transitions. [2018-06-24 20:55:42,938 INFO ]: Start accepts. Automaton has 179 states and 229 transitions. Word has length 20 [2018-06-24 20:55:42,938 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:42,938 INFO ]: Abstraction has 179 states and 229 transitions. [2018-06-24 20:55:42,938 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:55:42,938 INFO ]: Start isEmpty. Operand 179 states and 229 transitions. [2018-06-24 20:55:42,938 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:42,938 INFO ]: Found error trace [2018-06-24 20:55:42,938 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:42,938 INFO ]: === Iteration 70 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:42,938 INFO ]: Analyzing trace with hash -1755561530, now seen corresponding path program 11 times [2018-06-24 20:55:42,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:42,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:42,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:42,939 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:42,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:42,947 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:43,138 INFO ]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:43,138 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:43,138 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:43,143 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:55:43,186 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:55:43,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:43,189 INFO ]: Computing forward predicates... [2018-06-24 20:55:43,446 INFO ]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:43,465 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:43,465 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:43,465 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:43,465 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:43,465 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:43,466 INFO ]: Start difference. First operand 179 states and 229 transitions. Second operand 19 states. [2018-06-24 20:55:43,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:43,919 INFO ]: Finished difference Result 315 states and 370 transitions. [2018-06-24 20:55:43,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:55:43,919 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:43,919 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:43,920 INFO ]: With dead ends: 315 [2018-06-24 20:55:43,920 INFO ]: Without dead ends: 307 [2018-06-24 20:55:43,920 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:55:43,921 INFO ]: Start minimizeSevpa. Operand 307 states. [2018-06-24 20:55:43,923 INFO ]: Finished minimizeSevpa. Reduced states from 307 to 173. [2018-06-24 20:55:43,923 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 20:55:43,924 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 222 transitions. [2018-06-24 20:55:43,924 INFO ]: Start accepts. Automaton has 173 states and 222 transitions. Word has length 20 [2018-06-24 20:55:43,924 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:43,924 INFO ]: Abstraction has 173 states and 222 transitions. [2018-06-24 20:55:43,924 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:43,924 INFO ]: Start isEmpty. Operand 173 states and 222 transitions. [2018-06-24 20:55:43,924 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:43,924 INFO ]: Found error trace [2018-06-24 20:55:43,924 INFO ]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:43,925 INFO ]: === Iteration 71 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:43,925 INFO ]: Analyzing trace with hash 720009486, now seen corresponding path program 12 times [2018-06-24 20:55:43,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:43,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:43,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:43,925 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:43,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:43,933 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:45,280 INFO ]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:45,280 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:45,280 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:45,285 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:55:45,326 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:55:45,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:45,329 INFO ]: Computing forward predicates... [2018-06-24 20:55:45,379 INFO ]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:45,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:45,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:45,398 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:45,398 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:45,398 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:45,399 INFO ]: Start difference. First operand 173 states and 222 transitions. Second operand 19 states. [2018-06-24 20:55:45,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:45,871 INFO ]: Finished difference Result 296 states and 349 transitions. [2018-06-24 20:55:45,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:55:45,871 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:45,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:45,872 INFO ]: With dead ends: 296 [2018-06-24 20:55:45,872 INFO ]: Without dead ends: 288 [2018-06-24 20:55:45,872 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:55:45,872 INFO ]: Start minimizeSevpa. Operand 288 states. [2018-06-24 20:55:45,875 INFO ]: Finished minimizeSevpa. Reduced states from 288 to 173. [2018-06-24 20:55:45,875 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 20:55:45,876 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2018-06-24 20:55:45,876 INFO ]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 20 [2018-06-24 20:55:45,876 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:45,876 INFO ]: Abstraction has 173 states and 221 transitions. [2018-06-24 20:55:45,876 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:45,876 INFO ]: Start isEmpty. Operand 173 states and 221 transitions. [2018-06-24 20:55:45,876 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:45,876 INFO ]: Found error trace [2018-06-24 20:55:45,876 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:45,876 INFO ]: === Iteration 72 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:45,877 INFO ]: Analyzing trace with hash 153299654, now seen corresponding path program 13 times [2018-06-24 20:55:45,877 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:45,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:45,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:45,877 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:45,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:45,885 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:46,084 INFO ]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:46,084 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:46,084 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:46,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:46,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:46,132 INFO ]: Computing forward predicates... [2018-06-24 20:55:46,178 INFO ]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:46,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:46,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:46,198 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:46,198 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:46,198 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:46,198 INFO ]: Start difference. First operand 173 states and 221 transitions. Second operand 19 states. [2018-06-24 20:55:46,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:46,678 INFO ]: Finished difference Result 258 states and 309 transitions. [2018-06-24 20:55:46,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:55:46,678 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:46,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:46,679 INFO ]: With dead ends: 258 [2018-06-24 20:55:46,679 INFO ]: Without dead ends: 250 [2018-06-24 20:55:46,679 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:55:46,679 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-24 20:55:46,681 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 173. [2018-06-24 20:55:46,681 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 20:55:46,681 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2018-06-24 20:55:46,681 INFO ]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 20 [2018-06-24 20:55:46,681 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:46,681 INFO ]: Abstraction has 173 states and 220 transitions. [2018-06-24 20:55:46,681 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:46,681 INFO ]: Start isEmpty. Operand 173 states and 220 transitions. [2018-06-24 20:55:46,681 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:46,681 INFO ]: Found error trace [2018-06-24 20:55:46,681 INFO ]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:46,681 INFO ]: === Iteration 73 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:46,681 INFO ]: Analyzing trace with hash -234835954, now seen corresponding path program 14 times [2018-06-24 20:55:46,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:46,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:46,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:46,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:55:46,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:46,691 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:46,915 INFO ]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:46,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:46,915 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:46,920 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:55:46,982 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:55:46,982 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:46,984 INFO ]: Computing forward predicates... [2018-06-24 20:55:47,026 INFO ]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:47,044 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:47,044 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:47,044 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:47,045 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:47,045 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:47,045 INFO ]: Start difference. First operand 173 states and 220 transitions. Second operand 19 states. [2018-06-24 20:55:47,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:47,492 INFO ]: Finished difference Result 229 states and 278 transitions. [2018-06-24 20:55:47,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:55:47,492 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:47,492 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:47,492 INFO ]: With dead ends: 229 [2018-06-24 20:55:47,492 INFO ]: Without dead ends: 221 [2018-06-24 20:55:47,493 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:55:47,493 INFO ]: Start minimizeSevpa. Operand 221 states. [2018-06-24 20:55:47,494 INFO ]: Finished minimizeSevpa. Reduced states from 221 to 173. [2018-06-24 20:55:47,494 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 20:55:47,494 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2018-06-24 20:55:47,494 INFO ]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 20 [2018-06-24 20:55:47,494 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:47,494 INFO ]: Abstraction has 173 states and 219 transitions. [2018-06-24 20:55:47,494 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:47,494 INFO ]: Start isEmpty. Operand 173 states and 219 transitions. [2018-06-24 20:55:47,495 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:47,495 INFO ]: Found error trace [2018-06-24 20:55:47,495 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:47,495 INFO ]: === Iteration 74 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:47,495 INFO ]: Analyzing trace with hash 617862086, now seen corresponding path program 15 times [2018-06-24 20:55:47,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:47,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:47,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:47,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:47,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:47,502 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:47,676 INFO ]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:47,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:47,676 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:47,687 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:55:47,730 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:55:47,730 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:47,732 INFO ]: Computing forward predicates... [2018-06-24 20:55:47,771 INFO ]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:47,789 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:47,789 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:47,790 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:47,790 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:47,790 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:47,790 INFO ]: Start difference. First operand 173 states and 219 transitions. Second operand 19 states. [2018-06-24 20:55:48,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:48,203 INFO ]: Finished difference Result 201 states and 248 transitions. [2018-06-24 20:55:48,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:55:48,203 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:48,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:48,204 INFO ]: With dead ends: 201 [2018-06-24 20:55:48,204 INFO ]: Without dead ends: 193 [2018-06-24 20:55:48,204 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:55:48,204 INFO ]: Start minimizeSevpa. Operand 193 states. [2018-06-24 20:55:48,206 INFO ]: Finished minimizeSevpa. Reduced states from 193 to 173. [2018-06-24 20:55:48,206 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-24 20:55:48,206 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 218 transitions. [2018-06-24 20:55:48,206 INFO ]: Start accepts. Automaton has 173 states and 218 transitions. Word has length 20 [2018-06-24 20:55:48,206 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:48,206 INFO ]: Abstraction has 173 states and 218 transitions. [2018-06-24 20:55:48,206 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:48,206 INFO ]: Start isEmpty. Operand 173 states and 218 transitions. [2018-06-24 20:55:48,206 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:55:48,206 INFO ]: Found error trace [2018-06-24 20:55:48,207 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:48,207 INFO ]: === Iteration 75 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:48,207 INFO ]: Analyzing trace with hash 1281697550, now seen corresponding path program 16 times [2018-06-24 20:55:48,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:48,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:48,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:48,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:48,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:48,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:48,784 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:48,784 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:55:48,784 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:55:48,789 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:55:48,830 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:55:48,830 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:55:48,833 INFO ]: Computing forward predicates... [2018-06-24 20:55:48,869 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:55:48,888 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:55:48,889 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:55:48,889 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:55:48,889 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:55:48,889 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:55:48,889 INFO ]: Start difference. First operand 173 states and 218 transitions. Second operand 19 states. [2018-06-24 20:55:49,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:55:49,284 INFO ]: Finished difference Result 194 states and 242 transitions. [2018-06-24 20:55:49,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:55:49,285 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:55:49,285 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:55:49,285 INFO ]: With dead ends: 194 [2018-06-24 20:55:49,285 INFO ]: Without dead ends: 194 [2018-06-24 20:55:49,285 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:55:49,285 INFO ]: Start minimizeSevpa. Operand 194 states. [2018-06-24 20:55:49,287 INFO ]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-06-24 20:55:49,287 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-24 20:55:49,287 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 222 transitions. [2018-06-24 20:55:49,287 INFO ]: Start accepts. Automaton has 176 states and 222 transitions. Word has length 20 [2018-06-24 20:55:49,287 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:55:49,287 INFO ]: Abstraction has 176 states and 222 transitions. [2018-06-24 20:55:49,287 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:55:49,287 INFO ]: Start isEmpty. Operand 176 states and 222 transitions. [2018-06-24 20:55:49,288 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:55:49,288 INFO ]: Found error trace [2018-06-24 20:55:49,288 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:55:49,288 INFO ]: === Iteration 76 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:55:49,288 INFO ]: Analyzing trace with hash -1447879238, now seen corresponding path program 19 times [2018-06-24 20:55:49,288 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:55:49,288 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:55:49,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:49,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:55:49,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:55:49,296 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 20:55:49,413 WARN ]: Removed 1 from assertion stack [2018-06-24 20:55:49,413 WARN ]: Verification canceled [2018-06-24 20:55:49,415 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:55:49,416 WARN ]: Timeout [2018-06-24 20:55:49,416 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:55:49 BasicIcfg [2018-06-24 20:55:49,416 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:55:49,417 INFO ]: Toolchain (without parser) took 53817.01 ms. Allocated memory was 304.6 MB in the beginning and 756.0 MB in the end (delta: 451.4 MB). Free memory was 258.1 MB in the beginning and 388.3 MB in the end (delta: -130.2 MB). Peak memory consumption was 321.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,418 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:55:49,418 INFO ]: ChcToBoogie took 64.64 ms. Allocated memory is still 304.6 MB. Free memory was 258.1 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,419 INFO ]: Boogie Preprocessor took 31.66 ms. Allocated memory is still 304.6 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,419 INFO ]: RCFGBuilder took 343.56 ms. Allocated memory is still 304.6 MB. Free memory was 254.2 MB in the beginning and 241.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,419 INFO ]: BlockEncodingV2 took 88.89 ms. Allocated memory is still 304.6 MB. Free memory was 241.1 MB in the beginning and 236.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,419 INFO ]: TraceAbstraction took 53262.82 ms. Allocated memory was 304.6 MB in the beginning and 756.0 MB in the end (delta: 451.4 MB). Free memory was 236.1 MB in the beginning and 388.3 MB in the end (delta: -152.2 MB). Peak memory consumption was 299.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:55:49,422 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 15 locations, 20 edges - StatisticsResult: Encoded RCFG 9 locations, 14 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.64 ms. Allocated memory is still 304.6 MB. Free memory was 258.1 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 31.66 ms. Allocated memory is still 304.6 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 343.56 ms. Allocated memory is still 304.6 MB. Free memory was 254.2 MB in the beginning and 241.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 88.89 ms. Allocated memory is still 304.6 MB. Free memory was 241.1 MB in the beginning and 236.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53262.82 ms. Allocated memory was 304.6 MB in the beginning and 756.0 MB in the end (delta: 451.4 MB). Free memory was 236.1 MB in the beginning and 388.3 MB in the end (delta: -152.2 MB). Peak memory consumption was 299.2 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 22 with TraceHistMax 7, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 6. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 1 error locations. TIMEOUT Result, 53.2s OverallTime, 76 OverallIterations, 7 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1666 SDtfs, 3289 SDslu, 13255 SDs, 0 SdLazy, 14204 SolverSat, 1384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2664 GetRequests, 771 SyntacticMatches, 109 SemanticMatches, 1784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8921 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 75 MinimizatonAttempts, 4069 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2119 NumberOfCodeBlocksAsserted, 225 NumberOfCheckSat, 1976 ConstructedInterpolants, 0 QuantifiedInterpolants, 141265 SizeOfPredicates, 616 NumberOfNonLiveVariables, 20865 ConjunctsInSsa, 3360 ConjunctsInUnsatCore, 143 InterpolantComputations, 10 PerfectInterpolantSequences, 678/2520 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/while_after_while_if_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-55-49-432.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/while_after_while_if_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-55-49-432.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/while_after_while_if_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-55-49-432.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/while_after_while_if_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-55-49-432.csv Completed graceful shutdown