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/break_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:46:49,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:46:49,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:46:49,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:46:49,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:46:49,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:46:49,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:46:49,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:46:49,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:46:49,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:46:49,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:46:49,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:46:49,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:46:49,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:46:49,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:46:49,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:46:49,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:46:49,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:46:49,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:46:49,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:46:49,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:46:49,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:46:49,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:46:49,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:46:49,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:46:49,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:46:49,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:46:49,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:46:49,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:46:49,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:46:49,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:46:49,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:46:49,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:46:49,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:46:49,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:46:49,119 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:46:49,133 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:46:49,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:46:49,134 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:46:49,134 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:46:49,135 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:46:49,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:46:49,135 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:46:49,135 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:46:49,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:46:49,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:46:49,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:46:49,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:46:49,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:49,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:46:49,137 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:46:49,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:46:49,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:46:49,137 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:46:49,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:46:49,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:46:49,138 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:46:49,139 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:46:49,139 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:46:49,189 INFO ]: Repository-Root is: /tmp [2018-06-24 20:46:49,206 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:46:49,212 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:46:49,213 INFO ]: Initializing SmtParser... [2018-06-24 20:46:49,213 INFO ]: SmtParser initialized [2018-06-24 20:46:49,214 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-24 20:46:49,215 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:46:49,308 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 unknown [2018-06-24 20:46:49,445 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_merged_safe.c-1.smt2 [2018-06-24 20:46:49,452 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:46:49,457 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:46:49,458 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:46:49,460 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:46:49,460 INFO ]: ChcToBoogie initialized [2018-06-24 20:46:49,463 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,517 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49 Unit [2018-06-24 20:46:49,517 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:46:49,518 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:46:49,518 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:46:49,518 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:46:49,539 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,540 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,545 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,545 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,548 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,550 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,551 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,552 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:46:49,553 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:46:49,553 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:46:49,553 INFO ]: RCFGBuilder initialized [2018-06-24 20:46:49,556 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:46:49,567 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:46:49,567 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:46:49,567 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:46:49,567 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:46:49,567 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:46:49,567 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:46:49,747 INFO ]: Using library mode [2018-06-24 20:46:49,747 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:49 BoogieIcfgContainer [2018-06-24 20:46:49,747 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:46:49,748 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:46:49,748 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:46:49,749 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:46:49,749 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:49" (1/1) ... [2018-06-24 20:46:49,766 INFO ]: Initial Icfg 12 locations, 15 edges [2018-06-24 20:46:49,777 INFO ]: Using Remove infeasible edges [2018-06-24 20:46:49,778 INFO ]: Using Maximize final states [2018-06-24 20:46:49,778 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:46:49,778 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:46:49,780 INFO ]: Using Remove sink states [2018-06-24 20:46:49,781 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:46:49,781 INFO ]: Using Use SBE [2018-06-24 20:46:49,796 INFO ]: SBE split 0 edges [2018-06-24 20:46:49,801 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:46:49,802 INFO ]: 0 new accepting states [2018-06-24 20:46:49,870 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-24 20:46:49,873 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:49,874 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:46:49,874 INFO ]: 0 new accepting states [2018-06-24 20:46:49,875 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:46:49,884 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:46:49,884 INFO ]: Encoded RCFG 7 locations, 10 edges [2018-06-24 20:46:49,885 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:49 BasicIcfg [2018-06-24 20:46:49,885 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:46:49,886 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:46:49,886 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:46:49,889 INFO ]: TraceAbstraction initialized [2018-06-24 20:46:49,889 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:46:49" (1/4) ... [2018-06-24 20:46:49,890 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b5c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:46:49, skipping insertion in model container [2018-06-24 20:46:49,890 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:46:49" (2/4) ... [2018-06-24 20:46:49,890 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b5c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:46:49, skipping insertion in model container [2018-06-24 20:46:49,890 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:46:49" (3/4) ... [2018-06-24 20:46:49,891 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b5c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:46:49, skipping insertion in model container [2018-06-24 20:46:49,891 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:46:49" (4/4) ... [2018-06-24 20:46:49,902 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:46:49,913 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:46:49,920 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:46:49,959 INFO ]: Using default assertion order modulation [2018-06-24 20:46:49,960 INFO ]: Interprodecural is true [2018-06-24 20:46:49,960 INFO ]: Hoare is false [2018-06-24 20:46:49,960 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:46:49,960 INFO ]: Backedges is TWOTRACK [2018-06-24 20:46:49,960 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:46:49,960 INFO ]: Difference is false [2018-06-24 20:46:49,960 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:46:49,960 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:46:49,971 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:46:49,992 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:46:49,992 INFO ]: Found error trace [2018-06-24 20:46:49,993 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:46:49,993 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:50,000 INFO ]: Analyzing trace with hash 1131330962, now seen corresponding path program 1 times [2018-06-24 20:46:50,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:50,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:50,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:50,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:50,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:50,080 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:50,167 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:46:50,169 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:50,169 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:46:50,170 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:46:50,181 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:46:50,182 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:50,184 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-24 20:46:50,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:50,312 INFO ]: Finished difference Result 9 states and 14 transitions. [2018-06-24 20:46:50,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:46:50,314 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:46:50,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:50,320 INFO ]: With dead ends: 9 [2018-06-24 20:46:50,320 INFO ]: Without dead ends: 8 [2018-06-24 20:46:50,322 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:46:50,334 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:46:50,356 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:46:50,358 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:46:50,358 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:46:50,359 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:46:50,359 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:50,359 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:46:50,359 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:46:50,359 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:46:50,361 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:46:50,361 INFO ]: Found error trace [2018-06-24 20:46:50,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:46:50,361 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:50,361 INFO ]: Analyzing trace with hash 1132254483, now seen corresponding path program 1 times [2018-06-24 20:46:50,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:50,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:50,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:50,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:50,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:50,377 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:50,719 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-06-24 20:46:50,745 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:46:50,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:50,746 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:46:50,747 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:46:50,747 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:46:50,747 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:50,747 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2018-06-24 20:46:50,908 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-24 20:46:51,048 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:51,049 INFO ]: Finished difference Result 12 states and 18 transitions. [2018-06-24 20:46:51,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:46:51,049 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:46:51,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:51,051 INFO ]: With dead ends: 12 [2018-06-24 20:46:51,051 INFO ]: Without dead ends: 12 [2018-06-24 20:46:51,052 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:51,052 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:46:51,054 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-24 20:46:51,054 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:46:51,054 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:46:51,055 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 6 [2018-06-24 20:46:51,055 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:51,055 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:46:51,055 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:46:51,055 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:46:51,055 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:51,055 INFO ]: Found error trace [2018-06-24 20:46:51,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:51,055 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:51,055 INFO ]: Analyzing trace with hash 711912865, now seen corresponding path program 1 times [2018-06-24 20:46:51,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:51,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:51,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,133 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:46:51,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:51,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:46:51,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,178 INFO ]: Computing forward predicates... [2018-06-24 20:46:51,195 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:46:51,222 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:51,222 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:46:51,223 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:51,223 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:51,223 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:51,223 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-24 20:46:51,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:51,273 INFO ]: Finished difference Result 13 states and 20 transitions. [2018-06-24 20:46:51,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:51,273 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:46:51,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:51,274 INFO ]: With dead ends: 13 [2018-06-24 20:46:51,274 INFO ]: Without dead ends: 11 [2018-06-24 20:46:51,274 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:51,274 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:46:51,276 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:46:51,276 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:51,276 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-24 20:46:51,277 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 7 [2018-06-24 20:46:51,277 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:51,277 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-24 20:46:51,277 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:51,277 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-24 20:46:51,277 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:51,277 INFO ]: Found error trace [2018-06-24 20:46:51,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:51,277 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:51,277 INFO ]: Analyzing trace with hash 740005778, now seen corresponding path program 1 times [2018-06-24 20:46:51,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:51,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:51,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,288 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,344 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:46:51,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:51,345 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:46:51,345 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:51,345 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:51,345 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:51,346 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 5 states. [2018-06-24 20:46:51,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:51,508 INFO ]: Finished difference Result 16 states and 22 transitions. [2018-06-24 20:46:51,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:46:51,509 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:46:51,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:51,509 INFO ]: With dead ends: 16 [2018-06-24 20:46:51,509 INFO ]: Without dead ends: 14 [2018-06-24 20:46:51,509 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:51,509 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:51,511 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 20:46:51,511 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:46:51,511 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-24 20:46:51,511 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2018-06-24 20:46:51,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:51,511 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-24 20:46:51,511 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:51,511 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-24 20:46:51,512 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:51,512 INFO ]: Found error trace [2018-06-24 20:46:51,512 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:51,512 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:51,512 INFO ]: Analyzing trace with hash 740542016, now seen corresponding path program 1 times [2018-06-24 20:46:51,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:51,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:51,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,521 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,614 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:46:51,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:46:51,614 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:46:51,615 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:51,615 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:51,615 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:51,615 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 5 states. [2018-06-24 20:46:51,748 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-24 20:46:51,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:51,775 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-24 20:46:51,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:51,776 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:46:51,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:51,776 INFO ]: With dead ends: 15 [2018-06-24 20:46:51,776 INFO ]: Without dead ends: 15 [2018-06-24 20:46:51,777 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:51,777 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:46:51,778 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-24 20:46:51,778 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:46:51,779 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-06-24 20:46:51,779 INFO ]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 7 [2018-06-24 20:46:51,779 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:51,779 INFO ]: Abstraction has 12 states and 18 transitions. [2018-06-24 20:46:51,779 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:51,779 INFO ]: Start isEmpty. Operand 12 states and 18 transitions. [2018-06-24 20:46:51,779 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:46:51,779 INFO ]: Found error trace [2018-06-24 20:46:51,779 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:51,779 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:51,780 INFO ]: Analyzing trace with hash 741852820, now seen corresponding path program 1 times [2018-06-24 20:46:51,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:51,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:51,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,780 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,780 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,787 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,815 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:46:51,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:51,815 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:46:51,838 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,850 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,851 INFO ]: Computing forward predicates... [2018-06-24 20:46:51,855 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:46:51,879 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:51,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-24 20:46:51,880 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:46:51,880 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:46:51,880 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:51,880 INFO ]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2018-06-24 20:46:51,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:51,892 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-24 20:46:51,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:46:51,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:46:51,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:51,893 INFO ]: With dead ends: 14 [2018-06-24 20:46:51,893 INFO ]: Without dead ends: 14 [2018-06-24 20:46:51,894 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:46:51,894 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:51,896 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 20:46:51,896 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:51,896 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-24 20:46:51,896 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2018-06-24 20:46:51,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:51,896 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-24 20:46:51,896 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:46:51,897 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-24 20:46:51,897 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:51,897 INFO ]: Found error trace [2018-06-24 20:46:51,897 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:51,897 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:51,897 INFO ]: Analyzing trace with hash 594853746, now seen corresponding path program 2 times [2018-06-24 20:46:51,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:51,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:51,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:51,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:51,907 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,961 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:51,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:51,961 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:46:51,971 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:51,982 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:51,982 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:51,983 INFO ]: Computing forward predicates... [2018-06-24 20:46:51,989 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:52,009 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:52,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:46:52,010 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:46:52,010 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:46:52,010 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:52,010 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 6 states. [2018-06-24 20:46:52,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:52,374 INFO ]: Finished difference Result 17 states and 25 transitions. [2018-06-24 20:46:52,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:46:52,375 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:46:52,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:52,375 INFO ]: With dead ends: 17 [2018-06-24 20:46:52,375 INFO ]: Without dead ends: 14 [2018-06-24 20:46:52,375 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:52,376 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:52,377 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:46:52,377 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:46:52,377 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-06-24 20:46:52,377 INFO ]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 8 [2018-06-24 20:46:52,377 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:52,377 INFO ]: Abstraction has 14 states and 20 transitions. [2018-06-24 20:46:52,377 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:46:52,377 INFO ]: Start isEmpty. Operand 14 states and 20 transitions. [2018-06-24 20:46:52,378 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:52,378 INFO ]: Found error trace [2018-06-24 20:46:52,378 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:52,378 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:52,378 INFO ]: Analyzing trace with hash 1481821189, now seen corresponding path program 1 times [2018-06-24 20:46:52,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:52,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:52,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:52,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:52,487 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:46:52,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:52,487 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:46:52,495 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:52,509 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:52,510 INFO ]: Computing forward predicates... [2018-06-24 20:46:52,522 INFO ]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 20:46:52,541 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:46:52,541 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-06-24 20:46:52,541 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:46:52,541 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:46:52,541 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:52,541 INFO ]: Start difference. First operand 14 states and 20 transitions. Second operand 7 states. [2018-06-24 20:46:52,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:52,976 INFO ]: Finished difference Result 27 states and 36 transitions. [2018-06-24 20:46:52,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:46:52,976 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:46:52,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:52,977 INFO ]: With dead ends: 27 [2018-06-24 20:46:52,977 INFO ]: Without dead ends: 27 [2018-06-24 20:46:52,977 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:46:52,978 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:46:52,979 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 13. [2018-06-24 20:46:52,979 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:46:52,980 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-24 20:46:52,980 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2018-06-24 20:46:52,980 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:52,980 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-24 20:46:52,980 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:46:52,980 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-24 20:46:52,980 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:46:52,980 INFO ]: Found error trace [2018-06-24 20:46:52,980 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:52,980 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:52,980 INFO ]: Analyzing trace with hash 1522456113, now seen corresponding path program 2 times [2018-06-24 20:46:52,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:52,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:52,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:52,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:52,987 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,023 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:53,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:53,023 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:46:53,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:53,053 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:53,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,054 INFO ]: Computing forward predicates... [2018-06-24 20:46:53,058 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:53,089 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:53,089 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:46:53,089 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:46:53,089 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:46:53,089 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:53,090 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 5 states. [2018-06-24 20:46:53,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:53,101 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-24 20:46:53,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:46:53,101 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-24 20:46:53,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:53,101 INFO ]: With dead ends: 14 [2018-06-24 20:46:53,101 INFO ]: Without dead ends: 14 [2018-06-24 20:46:53,102 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:46:53,102 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:46:53,103 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:46:53,103 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:46:53,104 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-24 20:46:53,104 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-06-24 20:46:53,104 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:53,104 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-24 20:46:53,104 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:46:53,104 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-24 20:46:53,104 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:46:53,104 INFO ]: Found error trace [2018-06-24 20:46:53,104 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:53,105 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:53,105 INFO ]: Analyzing trace with hash 1260988353, now seen corresponding path program 3 times [2018-06-24 20:46:53,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:53,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:53,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:53,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,113 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,203 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:46:53,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:53,203 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:46:53,211 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:53,223 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:46:53,223 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,224 INFO ]: Computing forward predicates... [2018-06-24 20:46:53,240 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:46:53,260 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:46:53,260 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-24 20:46:53,260 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:46:53,261 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:46:53,261 INFO ]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:53,261 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 9 states. [2018-06-24 20:46:53,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:53,486 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-24 20:46:53,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:46:53,486 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:46:53,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:53,487 INFO ]: With dead ends: 27 [2018-06-24 20:46:53,487 INFO ]: Without dead ends: 22 [2018-06-24 20:46:53,487 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:46:53,487 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:46:53,489 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-24 20:46:53,489 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:46:53,490 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-24 20:46:53,490 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2018-06-24 20:46:53,490 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:53,490 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-24 20:46:53,490 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:46:53,490 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-24 20:46:53,490 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:46:53,490 INFO ]: Found error trace [2018-06-24 20:46:53,490 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:53,490 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:53,490 INFO ]: Analyzing trace with hash -48645580, now seen corresponding path program 3 times [2018-06-24 20:46:53,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:53,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:53,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,491 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:53,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,502 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,552 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:46:53,552 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:53,552 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:46:53,561 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:53,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:46:53,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,572 INFO ]: Computing forward predicates... [2018-06-24 20:46:53,577 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:46:53,599 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:53,599 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:46:53,599 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:46:53,599 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:46:53,599 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:53,600 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 6 states. [2018-06-24 20:46:53,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:53,613 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-24 20:46:53,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:46:53,614 INFO ]: Start accepts. Automaton has 6 states. Word has length 9 [2018-06-24 20:46:53,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:53,614 INFO ]: With dead ends: 17 [2018-06-24 20:46:53,614 INFO ]: Without dead ends: 17 [2018-06-24 20:46:53,614 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:46:53,614 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:46:53,615 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-24 20:46:53,615 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:46:53,615 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-24 20:46:53,615 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2018-06-24 20:46:53,615 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:53,615 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-24 20:46:53,615 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:46:53,615 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-24 20:46:53,616 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:46:53,616 INFO ]: Found error trace [2018-06-24 20:46:53,616 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:53,616 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:53,616 INFO ]: Analyzing trace with hash -1508157807, now seen corresponding path program 4 times [2018-06-24 20:46:53,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:53,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:53,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,616 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:53,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,663 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:53,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:53,664 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:46:53,670 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:53,680 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:53,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,681 INFO ]: Computing forward predicates... [2018-06-24 20:46:53,687 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:53,710 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:53,710 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-24 20:46:53,710 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:46:53,710 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:46:53,710 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:53,710 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2018-06-24 20:46:53,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:53,749 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-24 20:46:53,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:46:53,750 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-24 20:46:53,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:53,750 INFO ]: With dead ends: 18 [2018-06-24 20:46:53,750 INFO ]: Without dead ends: 18 [2018-06-24 20:46:53,750 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:46:53,750 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:46:53,752 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-24 20:46:53,752 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:46:53,752 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-06-24 20:46:53,752 INFO ]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-06-24 20:46:53,753 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:53,753 INFO ]: Abstraction has 17 states and 21 transitions. [2018-06-24 20:46:53,753 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:46:53,753 INFO ]: Start isEmpty. Operand 17 states and 21 transitions. [2018-06-24 20:46:53,753 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:46:53,753 INFO ]: Found error trace [2018-06-24 20:46:53,753 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:53,753 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:53,753 INFO ]: Analyzing trace with hash 641018675, now seen corresponding path program 1 times [2018-06-24 20:46:53,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:53,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:53,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:53,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:53,762 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,828 INFO ]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:46:53,828 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:53,828 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:46:53,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:53,852 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:53,853 INFO ]: Computing forward predicates... [2018-06-24 20:46:53,904 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:46:53,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:53,925 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-24 20:46:53,925 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:46:53,926 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:46:53,926 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:53,926 INFO ]: Start difference. First operand 17 states and 21 transitions. Second operand 12 states. [2018-06-24 20:46:54,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:54,238 INFO ]: Finished difference Result 43 states and 53 transitions. [2018-06-24 20:46:54,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:46:54,238 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:46:54,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:54,239 INFO ]: With dead ends: 43 [2018-06-24 20:46:54,239 INFO ]: Without dead ends: 36 [2018-06-24 20:46:54,239 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:46:54,240 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:46:54,241 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-06-24 20:46:54,242 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:46:54,242 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-24 20:46:54,242 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2018-06-24 20:46:54,242 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:54,242 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-24 20:46:54,242 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:46:54,242 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-24 20:46:54,242 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:46:54,242 INFO ]: Found error trace [2018-06-24 20:46:54,242 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:54,243 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:54,243 INFO ]: Analyzing trace with hash 491603412, now seen corresponding path program 5 times [2018-06-24 20:46:54,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:54,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:54,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,243 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:54,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:54,323 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:54,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:54,323 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:46:54,329 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:46:54,342 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:46:54,342 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:54,343 INFO ]: Computing forward predicates... [2018-06-24 20:46:54,350 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:54,369 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:54,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:46:54,369 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:46:54,369 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:46:54,370 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:54,370 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2018-06-24 20:46:54,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:54,537 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-24 20:46:54,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:46:54,538 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-24 20:46:54,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:54,538 INFO ]: With dead ends: 21 [2018-06-24 20:46:54,538 INFO ]: Without dead ends: 21 [2018-06-24 20:46:54,539 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:46:54,539 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:46:54,540 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-24 20:46:54,540 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:46:54,540 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-24 20:46:54,540 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-06-24 20:46:54,541 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:54,541 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-24 20:46:54,541 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:46:54,541 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-24 20:46:54,541 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:46:54,541 INFO ]: Found error trace [2018-06-24 20:46:54,541 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:54,541 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:54,541 INFO ]: Analyzing trace with hash -1940308239, now seen corresponding path program 6 times [2018-06-24 20:46:54,541 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:54,541 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:54,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,542 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:54,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:54,598 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:54,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:54,598 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:46:54,606 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:46:54,669 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:46:54,669 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:54,671 INFO ]: Computing forward predicates... [2018-06-24 20:46:54,678 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:54,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:54,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-24 20:46:54,709 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:46:54,709 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:46:54,709 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:54,710 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2018-06-24 20:46:54,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:54,836 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-24 20:46:54,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:46:54,836 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-24 20:46:54,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:54,836 INFO ]: With dead ends: 22 [2018-06-24 20:46:54,836 INFO ]: Without dead ends: 22 [2018-06-24 20:46:54,837 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:46:54,837 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:46:54,838 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-24 20:46:54,838 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:46:54,839 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-06-24 20:46:54,839 INFO ]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2018-06-24 20:46:54,839 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:54,839 INFO ]: Abstraction has 20 states and 24 transitions. [2018-06-24 20:46:54,839 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:46:54,839 INFO ]: Start isEmpty. Operand 20 states and 24 transitions. [2018-06-24 20:46:54,839 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:46:54,839 INFO ]: Found error trace [2018-06-24 20:46:54,839 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:54,839 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:54,839 INFO ]: Analyzing trace with hash -1945653695, now seen corresponding path program 2 times [2018-06-24 20:46:54,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:54,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:54,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,840 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:54,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:54,850 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:55,067 INFO ]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:46:55,067 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:55,067 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:46:55,073 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:55,087 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:55,087 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:55,089 INFO ]: Computing forward predicates... [2018-06-24 20:46:55,164 INFO ]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:46:55,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:55,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-24 20:46:55,193 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:46:55,193 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:46:55,193 INFO ]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:46:55,193 INFO ]: Start difference. First operand 20 states and 24 transitions. Second operand 15 states. [2018-06-24 20:46:55,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:55,975 INFO ]: Finished difference Result 64 states and 76 transitions. [2018-06-24 20:46:55,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:46:55,975 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-24 20:46:55,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:55,976 INFO ]: With dead ends: 64 [2018-06-24 20:46:55,976 INFO ]: Without dead ends: 54 [2018-06-24 20:46:55,976 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:46:55,976 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:46:55,979 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 21. [2018-06-24 20:46:55,979 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:46:55,979 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-24 20:46:55,979 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-06-24 20:46:55,979 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:55,979 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-24 20:46:55,979 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:46:55,979 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-24 20:46:55,980 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:46:55,980 INFO ]: Found error trace [2018-06-24 20:46:55,980 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:55,980 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:55,980 INFO ]: Analyzing trace with hash -20158092, now seen corresponding path program 7 times [2018-06-24 20:46:55,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:55,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:55,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:55,980 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:55,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:55,999 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,102 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:56,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:56,102 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:46:56,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:56,132 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,135 INFO ]: Computing forward predicates... [2018-06-24 20:46:56,148 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:56,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:56,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:46:56,177 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:46:56,177 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:46:56,177 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:46:56,178 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2018-06-24 20:46:56,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:56,192 INFO ]: Finished difference Result 25 states and 29 transitions. [2018-06-24 20:46:56,192 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:46:56,192 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-24 20:46:56,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:56,192 INFO ]: With dead ends: 25 [2018-06-24 20:46:56,192 INFO ]: Without dead ends: 25 [2018-06-24 20:46:56,193 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:46:56,193 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:46:56,194 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-24 20:46:56,194 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:46:56,195 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-24 20:46:56,195 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2018-06-24 20:46:56,195 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:56,195 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-24 20:46:56,195 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:46:56,195 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-24 20:46:56,195 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:46:56,195 INFO ]: Found error trace [2018-06-24 20:46:56,195 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:56,195 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:56,195 INFO ]: Analyzing trace with hash -625045679, now seen corresponding path program 8 times [2018-06-24 20:46:56,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:56,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:56,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:56,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:46:56,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:56,203 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,283 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:56,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:56,283 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:46:56,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:46:56,303 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:46:56,303 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,305 INFO ]: Computing forward predicates... [2018-06-24 20:46:56,313 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:56,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:56,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-24 20:46:56,345 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:46:56,345 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:46:56,345 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:56,345 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 11 states. [2018-06-24 20:46:56,410 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:56,411 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-24 20:46:56,411 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:46:56,411 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-24 20:46:56,411 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:56,411 INFO ]: With dead ends: 26 [2018-06-24 20:46:56,411 INFO ]: Without dead ends: 26 [2018-06-24 20:46:56,411 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:46:56,411 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:46:56,413 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-24 20:46:56,413 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:46:56,413 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-24 20:46:56,413 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-06-24 20:46:56,413 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:56,413 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-24 20:46:56,413 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:46:56,413 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-24 20:46:56,414 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:46:56,414 INFO ]: Found error trace [2018-06-24 20:46:56,414 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:56,414 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:56,414 INFO ]: Analyzing trace with hash 1623102771, now seen corresponding path program 3 times [2018-06-24 20:46:56,414 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:56,414 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:56,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:56,415 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:56,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:56,422 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,530 INFO ]: Checked inductivity of 27 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:46:56,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:56,530 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:46:56,545 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:56,571 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:46:56,571 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:56,573 INFO ]: Computing forward predicates... [2018-06-24 20:46:56,786 INFO ]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 20:46:56,805 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:56,805 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 20:46:56,805 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:46:56,805 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:46:56,805 INFO ]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:46:56,805 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 18 states. [2018-06-24 20:46:57,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:57,793 INFO ]: Finished difference Result 89 states and 103 transitions. [2018-06-24 20:46:57,793 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:46:57,793 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-24 20:46:57,794 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:57,794 INFO ]: With dead ends: 89 [2018-06-24 20:46:57,794 INFO ]: Without dead ends: 76 [2018-06-24 20:46:57,795 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=421, Invalid=1649, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:46:57,795 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-24 20:46:57,796 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 24. [2018-06-24 20:46:57,796 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:46:57,797 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-24 20:46:57,797 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-06-24 20:46:57,797 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:57,797 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-24 20:46:57,797 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:46:57,797 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-24 20:46:57,798 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:46:57,798 INFO ]: Found error trace [2018-06-24 20:46:57,798 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:57,798 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:57,798 INFO ]: Analyzing trace with hash 2098275604, now seen corresponding path program 9 times [2018-06-24 20:46:57,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:57,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:57,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:57,799 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:57,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:57,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,016 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:58,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:58,016 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:46:58,023 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:46:58,040 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:46:58,040 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,041 INFO ]: Computing forward predicates... [2018-06-24 20:46:58,048 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:58,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:58,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:46:58,068 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:46:58,068 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:46:58,068 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:58,068 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 12 states. [2018-06-24 20:46:58,095 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:58,095 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-24 20:46:58,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:46:58,095 INFO ]: Start accepts. Automaton has 12 states. Word has length 15 [2018-06-24 20:46:58,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:58,096 INFO ]: With dead ends: 29 [2018-06-24 20:46:58,096 INFO ]: Without dead ends: 29 [2018-06-24 20:46:58,096 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:46:58,096 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:46:58,098 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-24 20:46:58,098 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:46:58,098 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-06-24 20:46:58,098 INFO ]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2018-06-24 20:46:58,098 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:58,098 INFO ]: Abstraction has 25 states and 29 transitions. [2018-06-24 20:46:58,098 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:46:58,098 INFO ]: Start isEmpty. Operand 25 states and 29 transitions. [2018-06-24 20:46:58,099 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:46:58,099 INFO ]: Found error trace [2018-06-24 20:46:58,099 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:58,099 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:58,099 INFO ]: Analyzing trace with hash 621889457, now seen corresponding path program 10 times [2018-06-24 20:46:58,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:58,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:58,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:58,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:58,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:58,106 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,317 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:58,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:58,317 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:46:58,323 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:58,338 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:58,338 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,340 INFO ]: Computing forward predicates... [2018-06-24 20:46:58,348 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:58,369 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:58,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-24 20:46:58,370 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:46:58,370 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:46:58,370 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:46:58,370 INFO ]: Start difference. First operand 25 states and 29 transitions. Second operand 13 states. [2018-06-24 20:46:58,382 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:46:58,382 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-24 20:46:58,383 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:46:58,383 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-24 20:46:58,383 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:46:58,383 INFO ]: With dead ends: 30 [2018-06-24 20:46:58,383 INFO ]: Without dead ends: 30 [2018-06-24 20:46:58,383 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:46:58,383 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:46:58,385 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-06-24 20:46:58,385 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:46:58,385 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-24 20:46:58,385 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-06-24 20:46:58,385 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:46:58,385 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-24 20:46:58,385 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:46:58,386 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-24 20:46:58,386 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:46:58,386 INFO ]: Found error trace [2018-06-24 20:46:58,386 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:46:58,386 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:46:58,386 INFO ]: Analyzing trace with hash 2029814977, now seen corresponding path program 4 times [2018-06-24 20:46:58,386 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:46:58,386 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:46:58,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:58,387 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:46:58,387 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:46:58,395 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,870 INFO ]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:46:58,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:46:58,870 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:46:58,876 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:46:58,896 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:46:58,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:46:58,898 INFO ]: Computing forward predicates... [2018-06-24 20:46:59,024 INFO ]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:46:59,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:46:59,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2018-06-24 20:46:59,044 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:46:59,044 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:46:59,044 INFO ]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:46:59,044 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 23 states. [2018-06-24 20:46:59,448 WARN ]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-24 20:47:00,073 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:00,073 INFO ]: Finished difference Result 62 states and 69 transitions. [2018-06-24 20:47:00,073 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:47:00,073 INFO ]: Start accepts. Automaton has 23 states. Word has length 17 [2018-06-24 20:47:00,073 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:00,073 INFO ]: With dead ends: 62 [2018-06-24 20:47:00,073 INFO ]: Without dead ends: 45 [2018-06-24 20:47:00,074 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:47:00,074 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:47:00,076 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-06-24 20:47:00,076 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:47:00,077 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-06-24 20:47:00,077 INFO ]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-06-24 20:47:00,077 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:00,077 INFO ]: Abstraction has 27 states and 31 transitions. [2018-06-24 20:47:00,077 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:47:00,077 INFO ]: Start isEmpty. Operand 27 states and 31 transitions. [2018-06-24 20:47:00,077 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:47:00,077 INFO ]: Found error trace [2018-06-24 20:47:00,077 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:00,077 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:00,077 INFO ]: Analyzing trace with hash 2098559156, now seen corresponding path program 11 times [2018-06-24 20:47:00,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:00,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:00,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,078 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:00,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:00,091 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:00,510 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-24 20:47:00,935 INFO ]: Checked inductivity of 66 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:47:00,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:00,935 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:00,940 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:00,959 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:00,959 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:00,961 INFO ]: Computing forward predicates... [2018-06-24 20:47:00,997 INFO ]: Checked inductivity of 66 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:01,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:01,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-06-24 20:47:01,016 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:47:01,016 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:47:01,016 INFO ]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:47:01,016 INFO ]: Start difference. First operand 27 states and 31 transitions. Second operand 18 states. [2018-06-24 20:47:01,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:01,318 INFO ]: Finished difference Result 52 states and 57 transitions. [2018-06-24 20:47:01,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:47:01,320 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-24 20:47:01,320 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:01,320 INFO ]: With dead ends: 52 [2018-06-24 20:47:01,320 INFO ]: Without dead ends: 26 [2018-06-24 20:47:01,321 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=778, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:47:01,321 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:47:01,322 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:47:01,322 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:47:01,323 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:47:01,323 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-06-24 20:47:01,323 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:01,323 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:47:01,323 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:47:01,323 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:47:01,323 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:47:01,323 INFO ]: Found error trace [2018-06-24 20:47:01,323 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:01,323 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:01,323 INFO ]: Analyzing trace with hash -1737003213, now seen corresponding path program 5 times [2018-06-24 20:47:01,323 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:01,323 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:01,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,324 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:01,324 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:01,335 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,505 INFO ]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 20:47:01,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:01,505 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:47:01,511 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:01,530 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:47:01,530 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:01,531 INFO ]: Computing forward predicates... [2018-06-24 20:47:01,671 INFO ]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-24 20:47:01,691 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:01,691 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2018-06-24 20:47:01,691 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:47:01,691 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:47:01,691 INFO ]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:47:01,692 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2018-06-24 20:47:02,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:02,401 INFO ]: Finished difference Result 51 states and 55 transitions. [2018-06-24 20:47:02,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:47:02,401 INFO ]: Start accepts. Automaton has 24 states. Word has length 19 [2018-06-24 20:47:02,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:02,401 INFO ]: With dead ends: 51 [2018-06-24 20:47:02,401 INFO ]: Without dead ends: 33 [2018-06-24 20:47:02,402 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=413, Invalid=2137, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:47:02,402 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:47:02,404 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-24 20:47:02,404 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:47:02,405 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-24 20:47:02,405 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-06-24 20:47:02,405 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:02,405 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-24 20:47:02,405 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:47:02,405 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-24 20:47:02,405 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:47:02,405 INFO ]: Found error trace [2018-06-24 20:47:02,405 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:02,405 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:02,405 INFO ]: Analyzing trace with hash -2059687103, now seen corresponding path program 6 times [2018-06-24 20:47:02,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:02,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:02,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,406 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:02,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:02,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,684 INFO ]: Checked inductivity of 66 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 20:47:02,684 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:02,684 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:47:02,700 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:47:02,728 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:47:02,728 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:02,730 INFO ]: Computing forward predicates... [2018-06-24 20:47:02,906 INFO ]: Checked inductivity of 66 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:02,927 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:02,927 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-06-24 20:47:02,927 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:47:02,927 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:47:02,927 INFO ]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:47:02,928 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2018-06-24 20:47:03,678 WARN ]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-24 20:47:04,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:04,238 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-24 20:47:04,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:47:04,238 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-24 20:47:04,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:04,238 INFO ]: With dead ends: 54 [2018-06-24 20:47:04,238 INFO ]: Without dead ends: 35 [2018-06-24 20:47:04,239 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=522, Invalid=2784, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:47:04,239 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:47:04,240 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-06-24 20:47:04,240 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:47:04,241 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:47:04,241 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-06-24 20:47:04,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:04,241 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:47:04,241 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:47:04,241 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:47:04,241 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:47:04,241 INFO ]: Found error trace [2018-06-24 20:47:04,241 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:04,241 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:04,242 INFO ]: Analyzing trace with hash -1664370381, now seen corresponding path program 7 times [2018-06-24 20:47:04,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:04,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:04,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:04,242 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:04,242 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:04,251 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:04,621 INFO ]: Checked inductivity of 83 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 20:47:04,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:04,621 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:47:04,627 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:04,648 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:04,650 INFO ]: Computing forward predicates... [2018-06-24 20:47:04,806 INFO ]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-24 20:47:04,825 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:04,825 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-06-24 20:47:04,825 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:47:04,825 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:47:04,825 INFO ]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:47:04,825 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-24 20:47:05,391 WARN ]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-24 20:47:06,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:06,159 INFO ]: Finished difference Result 57 states and 61 transitions. [2018-06-24 20:47:06,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 20:47:06,210 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-24 20:47:06,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:06,210 INFO ]: With dead ends: 57 [2018-06-24 20:47:06,210 INFO ]: Without dead ends: 37 [2018-06-24 20:47:06,211 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=645, Invalid=3515, Unknown=0, NotChecked=0, Total=4160 [2018-06-24 20:47:06,211 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:47:06,213 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-24 20:47:06,213 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:06,214 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:47:06,214 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-06-24 20:47:06,214 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:06,214 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:47:06,214 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:47:06,214 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:47:06,214 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:47:06,214 INFO ]: Found error trace [2018-06-24 20:47:06,214 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:06,214 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:06,214 INFO ]: Analyzing trace with hash 586752449, now seen corresponding path program 8 times [2018-06-24 20:47:06,214 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:06,214 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:06,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:06,215 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:06,225 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:06,639 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:06,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:06,639 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) [2018-06-24 20:47:06,653 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:47:06,713 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:47:06,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:06,716 INFO ]: Computing forward predicates... [2018-06-24 20:47:07,078 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-24 20:47:07,096 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:07,096 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:47:07,097 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:07,097 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:07,097 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:07,097 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-24 20:47:07,518 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:07,518 INFO ]: Finished difference Result 38 states and 40 transitions. [2018-06-24 20:47:07,518 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:47:07,518 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-24 20:47:07,519 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:07,519 INFO ]: With dead ends: 38 [2018-06-24 20:47:07,519 INFO ]: Without dead ends: 38 [2018-06-24 20:47:07,519 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:47:07,519 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:47:07,607 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-06-24 20:47:07,607 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:07,608 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:47:07,608 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-06-24 20:47:07,608 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:07,608 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:47:07,608 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:07,608 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:47:07,608 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:47:07,608 INFO ]: Found error trace [2018-06-24 20:47:07,608 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:07,608 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:07,609 INFO ]: Analyzing trace with hash 1009311908, now seen corresponding path program 9 times [2018-06-24 20:47:07,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:07,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:07,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:07,609 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:07,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:07,622 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:08,150 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:08,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:08,150 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:47:08,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:47:08,188 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:47:08,188 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:08,190 INFO ]: Computing forward predicates... [2018-06-24 20:47:08,213 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-24 20:47:08,232 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:08,232 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:47:08,233 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:08,233 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:08,233 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:08,233 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-24 20:47:08,867 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:08,867 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-24 20:47:08,867 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:47:08,867 INFO ]: Start accepts. Automaton has 15 states. Word has length 26 [2018-06-24 20:47:08,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:08,868 INFO ]: With dead ends: 39 [2018-06-24 20:47:08,868 INFO ]: Without dead ends: 39 [2018-06-24 20:47:08,868 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:47:08,868 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:47:08,869 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 29. [2018-06-24 20:47:08,869 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:08,870 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:47:08,870 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-24 20:47:08,870 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:08,870 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:47:08,870 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:08,870 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:47:08,870 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:47:08,870 INFO ]: Found error trace [2018-06-24 20:47:08,870 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:08,870 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:08,871 INFO ]: Analyzing trace with hash 1223753249, now seen corresponding path program 10 times [2018-06-24 20:47:08,871 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:08,871 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:08,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:08,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:08,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:08,883 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,161 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:09,161 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:09,161 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:47:09,167 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:47:09,197 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:47:09,197 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:09,201 INFO ]: Computing forward predicates... [2018-06-24 20:47:09,284 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-24 20:47:09,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:09,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-24 20:47:09,303 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:09,303 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:09,303 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:09,303 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-24 20:47:09,605 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-06-24 20:47:09,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:09,881 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-24 20:47:09,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:47:09,881 INFO ]: Start accepts. Automaton has 15 states. Word has length 27 [2018-06-24 20:47:09,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:09,881 INFO ]: With dead ends: 40 [2018-06-24 20:47:09,881 INFO ]: Without dead ends: 40 [2018-06-24 20:47:09,882 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:47:09,882 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:47:09,883 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-06-24 20:47:09,883 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:09,883 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:47:09,883 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-24 20:47:09,883 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:09,883 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:47:09,883 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:09,884 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:47:09,884 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:47:09,884 INFO ]: Found error trace [2018-06-24 20:47:09,884 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:09,884 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:09,885 INFO ]: Analyzing trace with hash -718499772, now seen corresponding path program 11 times [2018-06-24 20:47:09,885 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:09,885 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:09,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:09,889 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:09,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:09,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:10,096 INFO ]: Checked inductivity of 132 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:47:10,096 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:10,096 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:47:10,102 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:47:10,134 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:47:10,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:10,136 INFO ]: Computing forward predicates... [2018-06-24 20:47:10,152 INFO ]: Checked inductivity of 132 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 20:47:10,171 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:47:10,171 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 15 [2018-06-24 20:47:10,171 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:47:10,171 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:47:10,172 INFO ]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:10,172 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-06-24 20:47:10,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:10,199 INFO ]: Finished difference Result 41 states and 43 transitions. [2018-06-24 20:47:10,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:47:10,200 INFO ]: Start accepts. Automaton has 15 states. Word has length 28 [2018-06-24 20:47:10,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:10,200 INFO ]: With dead ends: 41 [2018-06-24 20:47:10,200 INFO ]: Without dead ends: 29 [2018-06-24 20:47:10,200 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:47:10,201 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:47:10,202 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:47:10,202 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:47:10,202 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-24 20:47:10,202 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 28 [2018-06-24 20:47:10,202 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:10,202 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-24 20:47:10,202 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:47:10,202 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-24 20:47:10,203 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:47:10,203 INFO ]: Found error trace [2018-06-24 20:47:10,203 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:47:10,203 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:47:10,203 INFO ]: Analyzing trace with hash -1998363450, now seen corresponding path program 1 times [2018-06-24 20:47:10,203 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:47:10,203 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:47:10,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:10,203 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:47:10,203 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:47:10,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:10,351 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 20:47:10,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:47:10,351 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:47:10,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:47:10,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:47:10,383 INFO ]: Computing forward predicates... [2018-06-24 20:47:10,408 INFO ]: Checked inductivity of 132 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-24 20:47:10,427 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:47:10,427 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-24 20:47:10,427 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:47:10,427 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:47:10,427 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:47:10,427 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 5 states. [2018-06-24 20:47:10,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:47:10,437 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-24 20:47:10,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:47:10,438 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-24 20:47:10,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:47:10,438 INFO ]: With dead ends: 15 [2018-06-24 20:47:10,438 INFO ]: Without dead ends: 0 [2018-06-24 20:47:10,438 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:47:10,438 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 20:47:10,438 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 20:47:10,438 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 20:47:10,438 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 20:47:10,438 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-06-24 20:47:10,438 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:47:10,438 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 20:47:10,438 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:47:10,438 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 20:47:10,438 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 20:47:10,440 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:47:10,441 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:47:10 BasicIcfg [2018-06-24 20:47:10,441 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:47:10,442 INFO ]: Toolchain (without parser) took 20989.09 ms. Allocated memory was 309.3 MB in the beginning and 617.1 MB in the end (delta: 307.8 MB). Free memory was 266.4 MB in the beginning and 432.4 MB in the end (delta: -165.9 MB). Peak memory consumption was 141.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:10,442 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:47:10,443 INFO ]: ChcToBoogie took 59.74 ms. Allocated memory is still 309.3 MB. Free memory was 266.4 MB in the beginning and 264.4 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:47:10,443 INFO ]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 309.3 MB. Free memory was 264.4 MB in the beginning and 263.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-24 20:47:10,444 INFO ]: RCFGBuilder took 194.76 ms. Allocated memory is still 309.3 MB. Free memory was 263.4 MB in the beginning and 255.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:10,444 INFO ]: BlockEncodingV2 took 137.03 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 252.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:10,444 INFO ]: TraceAbstraction took 20555.00 ms. Allocated memory was 309.3 MB in the beginning and 617.1 MB in the end (delta: 307.8 MB). Free memory was 252.8 MB in the beginning and 432.4 MB in the end (delta: -179.5 MB). Peak memory consumption was 128.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:47:10,448 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 15 edges - StatisticsResult: Encoded RCFG 7 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 275.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.74 ms. Allocated memory is still 309.3 MB. Free memory was 266.4 MB in the beginning and 264.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 309.3 MB. Free memory was 264.4 MB in the beginning and 263.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 194.76 ms. Allocated memory is still 309.3 MB. Free memory was 263.4 MB in the beginning and 255.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 137.03 ms. Allocated memory is still 309.3 MB. Free memory was 255.8 MB in the beginning and 252.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20555.00 ms. Allocated memory was 309.3 MB in the beginning and 617.1 MB in the end (delta: 307.8 MB). Free memory was 252.8 MB in the beginning and 432.4 MB in the end (delta: -179.5 MB). Peak memory consumption was 128.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. SAFE Result, 20.4s OverallTime, 31 OverallIterations, 11 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 182 SDslu, 1137 SDs, 0 SdLazy, 2057 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 453 SyntacticMatches, 7 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3210 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=26, 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.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 222 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 860 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 57587 SizeOfPredicates, 78 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 674 ConjunctsInUnsatCore, 58 InterpolantComputations, 7 PerfectInterpolantSequences, 1010/2382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-47-10-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-47-10-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-47-10-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-47-10-456.csv Received shutdown request...