java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:57:58,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:57:58,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:57:58,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:57:58,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:57:58,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:57:58,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:57:58,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:57:58,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:57:58,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:57:58,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:57:58,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:57:58,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:57:58,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:57:58,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:57:58,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:57:58,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:57:58,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:57:58,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:57:58,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:57:58,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:57:58,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:57:58,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:57:58,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:57:58,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:57:58,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:57:58,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:57:58,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:57:58,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:57:58,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:57:58,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:57:58,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:57:58,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:57:58,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:57:58,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:57:58,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:57:58,151 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:57:58,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:57:58,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:57:58,174 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:57:58,174 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:57:58,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:57:58,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:57:58,178 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:57:58,178 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:57:58,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:57:58,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:57:58,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:57:58,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:57:58,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:57:58,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:57:58,179 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:57:58,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:57:58,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:57:58,180 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:57:58,180 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:57:58,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:57:58,180 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:57:58,182 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:57:58,182 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:57:58,217 INFO ]: Repository-Root is: /tmp [2018-06-26 17:57:58,230 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:57:58,238 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:57:58,240 INFO ]: Initializing SmtParser... [2018-06-26 17:57:58,240 INFO ]: SmtParser initialized [2018-06-26 17:57:58,241 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-26 17:57:58,242 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:57:58,331 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 unknown [2018-06-26 17:57:58,523 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003-horn.smt2 [2018-06-26 17:57:58,534 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:57:58,540 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:57:58,540 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:57:58,541 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:57:58,541 INFO ]: ChcToBoogie initialized [2018-06-26 17:57:58,545 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,603 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58 Unit [2018-06-26 17:57:58,603 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:57:58,604 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:57:58,604 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:57:58,605 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:57:58,627 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,627 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,633 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,633 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,637 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,639 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,640 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,649 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:57:58,650 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:57:58,650 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:57:58,650 INFO ]: RCFGBuilder initialized [2018-06-26 17:57:58,651 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:57:58,663 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:57:58,663 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:57:58,664 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:57:58,664 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:57:58,664 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:57:58,664 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:57:58,900 INFO ]: Using library mode [2018-06-26 17:57:58,900 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:58 BoogieIcfgContainer [2018-06-26 17:57:58,900 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:57:58,901 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:57:58,901 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:57:58,902 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:57:58,902 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:58" (1/1) ... [2018-06-26 17:57:58,926 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-26 17:57:58,928 INFO ]: Using Remove infeasible edges [2018-06-26 17:57:58,928 INFO ]: Using Maximize final states [2018-06-26 17:57:58,930 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:57:58,930 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:57:58,932 INFO ]: Using Remove sink states [2018-06-26 17:57:58,933 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:57:58,933 INFO ]: Using Use SBE [2018-06-26 17:57:58,939 INFO ]: SBE split 0 edges [2018-06-26 17:57:58,945 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:57:58,947 INFO ]: 0 new accepting states [2018-06-26 17:57:58,983 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 17:57:58,985 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:57:58,989 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:57:58,989 INFO ]: 0 new accepting states [2018-06-26 17:57:58,989 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:57:58,989 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:57:58,989 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-26 17:57:58,990 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:57:58 BasicIcfg [2018-06-26 17:57:58,990 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:57:58,991 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:57:58,991 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:57:58,994 INFO ]: TraceAbstraction initialized [2018-06-26 17:57:58,994 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:57:58" (1/4) ... [2018-06-26 17:57:58,995 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119bf80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:57:58, skipping insertion in model container [2018-06-26 17:57:58,995 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:58" (2/4) ... [2018-06-26 17:57:58,995 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119bf80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:57:58, skipping insertion in model container [2018-06-26 17:57:58,995 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:58" (3/4) ... [2018-06-26 17:57:58,996 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119bf80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:57:58, skipping insertion in model container [2018-06-26 17:57:58,996 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:57:58" (4/4) ... [2018-06-26 17:57:58,997 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:57:59,007 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:57:59,017 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:57:59,065 INFO ]: Using default assertion order modulation [2018-06-26 17:57:59,066 INFO ]: Interprodecural is true [2018-06-26 17:57:59,066 INFO ]: Hoare is false [2018-06-26 17:57:59,066 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:57:59,066 INFO ]: Backedges is TWOTRACK [2018-06-26 17:57:59,066 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:57:59,066 INFO ]: Difference is false [2018-06-26 17:57:59,066 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:57:59,066 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:57:59,080 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 17:57:59,105 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:57:59,105 INFO ]: Found error trace [2018-06-26 17:57:59,106 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:57:59,106 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:59,110 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-26 17:57:59,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:59,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:59,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:59,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,192 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:59,295 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:59,297 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:57:59,297 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:57:59,298 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:57:59,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:57:59,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:59,309 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 17:57:59,360 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:59,360 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-26 17:57:59,360 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:57:59,361 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:57:59,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:59,371 INFO ]: With dead ends: 7 [2018-06-26 17:57:59,371 INFO ]: Without dead ends: 7 [2018-06-26 17:57:59,373 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:59,386 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:57:59,405 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:57:59,406 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:57:59,407 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 17:57:59,408 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-26 17:57:59,408 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:59,408 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 17:57:59,408 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:57:59,408 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 17:57:59,408 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:57:59,408 INFO ]: Found error trace [2018-06-26 17:57:59,408 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:57:59,408 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:59,409 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-26 17:57:59,409 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:59,409 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:59,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,410 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:59,410 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,426 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:59,464 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:59,464 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:57:59,464 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:57:59,466 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:57:59,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:57:59,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:59,466 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 3 states. [2018-06-26 17:57:59,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:59,568 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-26 17:57:59,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:57:59,568 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 17:57:59,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:59,569 INFO ]: With dead ends: 8 [2018-06-26 17:57:59,569 INFO ]: Without dead ends: 7 [2018-06-26 17:57:59,569 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:59,570 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:57:59,570 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:57:59,570 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:57:59,571 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-06-26 17:57:59,571 INFO ]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 6 [2018-06-26 17:57:59,571 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:59,571 INFO ]: Abstraction has 7 states and 9 transitions. [2018-06-26 17:57:59,571 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:57:59,571 INFO ]: Start isEmpty. Operand 7 states and 9 transitions. [2018-06-26 17:57:59,571 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:57:59,571 INFO ]: Found error trace [2018-06-26 17:57:59,571 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:57:59,571 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:59,571 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-26 17:57:59,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:59,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:59,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:59,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:59,593 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:59,744 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:59,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:59,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:57:59,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:59,822 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:59,831 INFO ]: Computing forward predicates... [2018-06-26 17:57:59,920 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:59,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:59,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 17:57:59,939 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:57:59,939 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:57:59,939 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:57:59,940 INFO ]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2018-06-26 17:58:00,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:00,052 INFO ]: Finished difference Result 8 states and 11 transitions. [2018-06-26 17:58:00,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:58:00,053 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:58:00,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:00,053 INFO ]: With dead ends: 8 [2018-06-26 17:58:00,054 INFO ]: Without dead ends: 8 [2018-06-26 17:58:00,054 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:58:00,054 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:58:00,055 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:58:00,055 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:58:00,055 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-26 17:58:00,055 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-26 17:58:00,055 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:00,055 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-26 17:58:00,055 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:58:00,055 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-26 17:58:00,056 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:58:00,056 INFO ]: Found error trace [2018-06-26 17:58:00,056 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:58:00,056 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:00,056 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-26 17:58:00,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:00,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:00,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:00,058 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:00,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:00,086 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:00,150 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:00,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:00,150 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:00,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:00,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:00,197 INFO ]: Computing forward predicates... [2018-06-26 17:58:00,355 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:00,380 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:58:00,380 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-26 17:58:00,380 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:58:00,380 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:58:00,380 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:58:00,380 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 5 states. [2018-06-26 17:58:00,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:00,534 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-26 17:58:00,535 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:58:00,535 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:58:00,535 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:00,535 INFO ]: With dead ends: 10 [2018-06-26 17:58:00,535 INFO ]: Without dead ends: 8 [2018-06-26 17:58:00,536 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:58:00,536 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:58:00,537 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:58:00,537 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:58:00,537 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 17:58:00,537 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-26 17:58:00,537 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:00,537 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 17:58:00,537 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:58:00,537 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 17:58:00,537 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:58:00,537 INFO ]: Found error trace [2018-06-26 17:58:00,537 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 17:58:00,538 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:00,538 INFO ]: Analyzing trace with hash 1485878148, now seen corresponding path program 2 times [2018-06-26 17:58:00,538 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:00,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:00,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:00,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:00,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:00,594 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:00,977 WARN ]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-26 17:58:00,978 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:00,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:00,978 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:00,991 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:01,041 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:01,041 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:01,043 INFO ]: Computing forward predicates... [2018-06-26 17:58:01,090 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:01,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:01,115 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 17:58:01,115 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:58:01,115 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:58:01,115 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:58:01,115 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-06-26 17:58:01,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:01,253 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 17:58:01,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:58:01,254 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 17:58:01,254 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:01,254 INFO ]: With dead ends: 10 [2018-06-26 17:58:01,254 INFO ]: Without dead ends: 10 [2018-06-26 17:58:01,254 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:58:01,254 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:58:01,255 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:58:01,255 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:58:01,256 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 17:58:01,256 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-06-26 17:58:01,256 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:01,256 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 17:58:01,256 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:58:01,256 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 17:58:01,256 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:58:01,256 INFO ]: Found error trace [2018-06-26 17:58:01,256 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 17:58:01,256 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:01,256 INFO ]: Analyzing trace with hash 1989338180, now seen corresponding path program 3 times [2018-06-26 17:58:01,256 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:01,256 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:01,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:01,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:01,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:01,291 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:01,596 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:01,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:01,596 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:58:01,611 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:01,691 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:58:01,691 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:01,695 INFO ]: Computing forward predicates... [2018-06-26 17:58:02,078 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:02,111 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:02,111 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-26 17:58:02,112 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:58:02,112 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:58:02,112 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:58:02,112 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-06-26 17:58:02,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:02,287 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 17:58:02,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:58:02,287 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-26 17:58:02,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:02,288 INFO ]: With dead ends: 11 [2018-06-26 17:58:02,288 INFO ]: Without dead ends: 11 [2018-06-26 17:58:02,288 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:58:02,288 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:58:02,290 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:58:02,290 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:58:02,291 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 17:58:02,291 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 17:58:02,291 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:02,291 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 17:58:02,291 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:58:02,291 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 17:58:02,291 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:58:02,291 INFO ]: Found error trace [2018-06-26 17:58:02,291 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 17:58:02,291 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:02,291 INFO ]: Analyzing trace with hash 1539615818, now seen corresponding path program 4 times [2018-06-26 17:58:02,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:02,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:02,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:02,293 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:02,293 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:02,327 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:03,227 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:03,228 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:03,228 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:03,239 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:03,283 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:03,284 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:03,288 INFO ]: Computing forward predicates... [2018-06-26 17:58:03,428 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:03,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:03,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 17:58:03,459 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:58:03,460 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:58:03,460 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:58:03,460 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-26 17:58:03,560 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:03,560 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 17:58:03,560 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:58:03,560 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 17:58:03,560 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:03,560 INFO ]: With dead ends: 12 [2018-06-26 17:58:03,560 INFO ]: Without dead ends: 12 [2018-06-26 17:58:03,561 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:58:03,561 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:58:03,562 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:58:03,562 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:58:03,562 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 17:58:03,562 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 17:58:03,562 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:03,562 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 17:58:03,562 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:58:03,563 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 17:58:03,563 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:58:03,563 INFO ]: Found error trace [2018-06-26 17:58:03,563 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 17:58:03,563 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:03,563 INFO ]: Analyzing trace with hash 483124484, now seen corresponding path program 5 times [2018-06-26 17:58:03,563 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:03,563 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:03,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:03,564 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:03,564 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:03,598 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:03,856 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:03,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:03,856 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:03,872 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:03,972 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:58:03,972 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:03,977 INFO ]: Computing forward predicates... [2018-06-26 17:58:04,043 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:04,063 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:04,064 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 17:58:04,064 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:58:04,064 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:58:04,064 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:58:04,064 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-26 17:58:04,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:04,139 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 17:58:04,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:58:04,139 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 17:58:04,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:04,139 INFO ]: With dead ends: 13 [2018-06-26 17:58:04,139 INFO ]: Without dead ends: 13 [2018-06-26 17:58:04,140 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:58:04,140 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:58:04,141 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:58:04,141 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:58:04,141 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 17:58:04,142 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 17:58:04,142 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:04,142 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 17:58:04,142 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:58:04,142 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 17:58:04,142 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:58:04,142 INFO ]: Found error trace [2018-06-26 17:58:04,142 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 17:58:04,142 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:04,142 INFO ]: Analyzing trace with hash 2091631498, now seen corresponding path program 6 times [2018-06-26 17:58:04,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:04,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:04,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:04,143 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:04,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:04,165 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:04,402 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:04,402 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:04,402 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:04,414 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:04,474 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:58:04,474 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:04,479 INFO ]: Computing forward predicates... [2018-06-26 17:58:04,731 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:04,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:04,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 17:58:04,756 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:58:04,757 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:58:04,757 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:58:04,757 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-06-26 17:58:04,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:04,876 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 17:58:04,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:58:04,876 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 17:58:04,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:04,876 INFO ]: With dead ends: 14 [2018-06-26 17:58:04,876 INFO ]: Without dead ends: 14 [2018-06-26 17:58:04,877 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:58:04,877 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:58:04,878 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:58:04,878 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:58:04,878 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 17:58:04,878 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 17:58:04,878 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:04,878 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 17:58:04,878 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:58:04,878 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 17:58:04,879 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:58:04,879 INFO ]: Found error trace [2018-06-26 17:58:04,879 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 17:58:04,879 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:04,879 INFO ]: Analyzing trace with hash 415741380, now seen corresponding path program 7 times [2018-06-26 17:58:04,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:04,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:04,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:04,880 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:04,880 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:04,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:05,198 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:05,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:05,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:05,310 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:05,380 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:05,387 INFO ]: Computing forward predicates... [2018-06-26 17:58:05,649 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:05,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:05,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-26 17:58:05,669 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:58:05,669 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:58:05,669 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:58:05,669 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-06-26 17:58:05,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:05,747 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:58:05,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:58:05,747 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-26 17:58:05,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:05,748 INFO ]: With dead ends: 15 [2018-06-26 17:58:05,748 INFO ]: Without dead ends: 15 [2018-06-26 17:58:05,748 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:58:05,748 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:58:05,750 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:58:05,750 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:58:05,750 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 17:58:05,750 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 17:58:05,750 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:05,750 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 17:58:05,750 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:58:05,750 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 17:58:05,750 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:58:05,750 INFO ]: Found error trace [2018-06-26 17:58:05,751 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 17:58:05,751 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:05,751 INFO ]: Analyzing trace with hash 2755274, now seen corresponding path program 8 times [2018-06-26 17:58:05,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:05,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:05,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:05,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:05,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:05,793 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:06,049 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:06,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:06,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:06,054 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:06,114 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:06,114 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:06,120 INFO ]: Computing forward predicates... [2018-06-26 17:58:06,184 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:06,203 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:06,203 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 17:58:06,203 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:58:06,204 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:58:06,204 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:58:06,204 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-06-26 17:58:06,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:06,323 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 17:58:06,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:58:06,324 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 17:58:06,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:06,324 INFO ]: With dead ends: 16 [2018-06-26 17:58:06,324 INFO ]: Without dead ends: 16 [2018-06-26 17:58:06,325 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:58:06,325 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:58:06,326 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:58:06,326 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:58:06,326 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 17:58:06,326 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 17:58:06,326 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:06,326 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 17:58:06,326 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:58:06,326 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 17:58:06,327 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:58:06,327 INFO ]: Found error trace [2018-06-26 17:58:06,327 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 17:58:06,327 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:06,327 INFO ]: Analyzing trace with hash 85087876, now seen corresponding path program 9 times [2018-06-26 17:58:06,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:06,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:06,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:06,327 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:06,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:06,358 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:07,229 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:07,229 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:07,229 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:07,235 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:07,298 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:58:07,298 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:07,304 INFO ]: Computing forward predicates... [2018-06-26 17:58:07,519 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:07,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:07,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-26 17:58:07,545 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:58:07,545 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:58:07,546 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:58:07,546 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2018-06-26 17:58:07,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:07,668 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 17:58:07,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:58:07,668 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-26 17:58:07,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:07,668 INFO ]: With dead ends: 17 [2018-06-26 17:58:07,668 INFO ]: Without dead ends: 17 [2018-06-26 17:58:07,669 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:58:07,669 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:58:07,670 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:58:07,671 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:58:07,671 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 17:58:07,671 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 17:58:07,671 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:07,671 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 17:58:07,671 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:58:07,671 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 17:58:07,671 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:58:07,671 INFO ]: Found error trace [2018-06-26 17:58:07,671 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 17:58:07,672 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:07,672 INFO ]: Analyzing trace with hash -1657568758, now seen corresponding path program 10 times [2018-06-26 17:58:07,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:07,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:07,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:07,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:07,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:07,737 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:08,279 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:08,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:08,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:58:08,293 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:08,353 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:08,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:08,360 INFO ]: Computing forward predicates... [2018-06-26 17:58:08,451 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:08,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:08,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-26 17:58:08,470 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:58:08,470 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:58:08,470 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:58:08,471 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2018-06-26 17:58:08,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:08,663 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 17:58:08,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:58:08,663 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-26 17:58:08,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:08,664 INFO ]: With dead ends: 18 [2018-06-26 17:58:08,664 INFO ]: Without dead ends: 18 [2018-06-26 17:58:08,664 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:58:08,664 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:58:08,666 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:58:08,666 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:58:08,666 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 17:58:08,666 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 17:58:08,666 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:08,666 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 17:58:08,666 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:58:08,666 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 17:58:08,666 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:58:08,667 INFO ]: Found error trace [2018-06-26 17:58:08,667 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-26 17:58:08,667 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:08,667 INFO ]: Analyzing trace with hash 154650436, now seen corresponding path program 11 times [2018-06-26 17:58:08,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:08,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:08,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:08,667 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:08,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:08,721 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:09,011 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:09,011 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:09,011 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:09,017 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:09,078 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:58:09,078 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:09,085 INFO ]: Computing forward predicates... [2018-06-26 17:58:09,440 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:09,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:09,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 17:58:09,460 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:58:09,460 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:58:09,460 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:58:09,460 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-26 17:58:09,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:09,640 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 17:58:09,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:58:09,640 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-26 17:58:09,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:09,641 INFO ]: With dead ends: 19 [2018-06-26 17:58:09,641 INFO ]: Without dead ends: 19 [2018-06-26 17:58:09,641 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:58:09,641 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:58:09,643 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:58:09,643 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:58:09,643 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 17:58:09,643 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 17:58:09,643 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:09,643 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 17:58:09,643 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:58:09,643 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 17:58:09,644 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:58:09,644 INFO ]: Found error trace [2018-06-26 17:58:09,644 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-26 17:58:09,644 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:09,644 INFO ]: Analyzing trace with hash 498870602, now seen corresponding path program 12 times [2018-06-26 17:58:09,644 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:09,644 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:09,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:09,644 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:09,644 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:09,688 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:10,055 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:10,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:10,056 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:10,061 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:10,196 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 17:58:10,196 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:10,201 INFO ]: Computing forward predicates... [2018-06-26 17:58:10,376 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:10,395 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:10,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-26 17:58:10,395 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:58:10,395 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:58:10,396 INFO ]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:58:10,396 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2018-06-26 17:58:10,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:10,528 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 17:58:10,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:58:10,529 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-26 17:58:10,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:10,529 INFO ]: With dead ends: 20 [2018-06-26 17:58:10,529 INFO ]: Without dead ends: 20 [2018-06-26 17:58:10,530 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:58:10,530 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:58:10,531 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:58:10,531 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:58:10,531 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 17:58:10,531 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 17:58:10,532 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:10,532 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 17:58:10,532 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:58:10,532 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 17:58:10,532 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:58:10,532 INFO ]: Found error trace [2018-06-26 17:58:10,532 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-26 17:58:10,532 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:10,532 INFO ]: Analyzing trace with hash -1715206140, now seen corresponding path program 13 times [2018-06-26 17:58:10,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:10,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:10,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:10,534 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:10,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:10,574 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:11,335 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:11,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:11,335 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:11,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:11,416 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:11,424 INFO ]: Computing forward predicates... [2018-06-26 17:58:11,624 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:11,644 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:11,644 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-26 17:58:11,644 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:58:11,644 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:58:11,644 INFO ]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:58:11,644 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2018-06-26 17:58:11,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:11,952 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 17:58:11,953 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:58:11,953 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-26 17:58:11,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:11,953 INFO ]: With dead ends: 21 [2018-06-26 17:58:11,953 INFO ]: Without dead ends: 21 [2018-06-26 17:58:11,953 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:58:11,954 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:58:11,954 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:58:11,955 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:58:11,955 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 17:58:11,955 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 17:58:11,955 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:11,955 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 17:58:11,955 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:58:11,955 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 17:58:11,955 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:58:11,955 INFO ]: Found error trace [2018-06-26 17:58:11,955 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-26 17:58:11,955 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:11,956 INFO ]: Analyzing trace with hash -1632108406, now seen corresponding path program 14 times [2018-06-26 17:58:11,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:11,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:11,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:11,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:11,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:12,016 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:12,778 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:12,778 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:12,778 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:12,784 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:12,865 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:12,865 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:12,875 INFO ]: Computing forward predicates... [2018-06-26 17:58:13,034 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:13,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:13,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-26 17:58:13,054 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:58:13,054 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:58:13,054 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:58:13,054 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2018-06-26 17:58:13,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:13,240 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 17:58:13,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:58:13,241 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-26 17:58:13,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:13,241 INFO ]: With dead ends: 22 [2018-06-26 17:58:13,241 INFO ]: Without dead ends: 22 [2018-06-26 17:58:13,241 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:58:13,242 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:58:13,243 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:58:13,243 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:58:13,243 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 17:58:13,244 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 17:58:13,244 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:13,244 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 17:58:13,244 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:58:13,244 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 17:58:13,244 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:58:13,244 INFO ]: Found error trace [2018-06-26 17:58:13,244 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-26 17:58:13,244 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:13,244 INFO ]: Analyzing trace with hash 943921348, now seen corresponding path program 15 times [2018-06-26 17:58:13,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:13,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:13,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:13,245 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:13,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:13,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:13,901 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:13,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:13,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:13,907 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:13,999 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:58:13,999 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:14,009 INFO ]: Computing forward predicates... [2018-06-26 17:58:14,253 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:14,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:14,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-26 17:58:14,284 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:58:14,284 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:58:14,284 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:58:14,284 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-06-26 17:58:14,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:14,516 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 17:58:14,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:58:14,517 INFO ]: Start accepts. Automaton has 21 states. Word has length 21 [2018-06-26 17:58:14,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:14,517 INFO ]: With dead ends: 23 [2018-06-26 17:58:14,517 INFO ]: Without dead ends: 23 [2018-06-26 17:58:14,518 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:58:14,518 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:58:14,521 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:58:14,521 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:58:14,522 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 17:58:14,522 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 17:58:14,522 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:14,522 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 17:58:14,522 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:58:14,522 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 17:58:14,523 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:58:14,523 INFO ]: Found error trace [2018-06-26 17:58:14,523 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-26 17:58:14,523 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:14,523 INFO ]: Analyzing trace with hash -803534902, now seen corresponding path program 16 times [2018-06-26 17:58:14,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:14,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:14,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:14,523 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:14,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:14,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:15,163 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:15,163 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:15,163 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:15,168 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:15,256 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:15,256 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:15,268 INFO ]: Computing forward predicates... [2018-06-26 17:58:15,425 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:15,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:15,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-26 17:58:15,458 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:58:15,459 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:58:15,459 INFO ]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:58:15,459 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2018-06-26 17:58:15,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:15,735 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 17:58:15,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:58:15,735 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-26 17:58:15,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:15,736 INFO ]: With dead ends: 24 [2018-06-26 17:58:15,736 INFO ]: Without dead ends: 24 [2018-06-26 17:58:15,736 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:58:15,736 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:58:15,738 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:58:15,738 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:58:15,738 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 17:58:15,739 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 17:58:15,739 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:15,739 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 17:58:15,739 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:58:15,739 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 17:58:15,739 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:58:15,739 INFO ]: Found error trace [2018-06-26 17:58:15,739 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-26 17:58:15,739 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:15,739 INFO ]: Analyzing trace with hash 859896196, now seen corresponding path program 17 times [2018-06-26 17:58:15,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:15,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:15,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:15,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:15,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:15,815 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:16,292 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:16,292 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:16,292 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:16,298 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:16,446 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:58:16,446 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:16,455 INFO ]: Computing forward predicates... [2018-06-26 17:58:16,611 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:16,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:16,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-26 17:58:16,631 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:58:16,631 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:58:16,631 INFO ]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:58:16,631 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2018-06-26 17:58:16,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:16,871 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 17:58:16,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:58:16,871 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-26 17:58:16,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:16,872 INFO ]: With dead ends: 25 [2018-06-26 17:58:16,872 INFO ]: Without dead ends: 25 [2018-06-26 17:58:16,872 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:58:16,872 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:58:16,873 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:58:16,873 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:58:16,874 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 17:58:16,874 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 17:58:16,874 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:16,874 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 17:58:16,874 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:58:16,874 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 17:58:16,874 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:58:16,874 INFO ]: Found error trace [2018-06-26 17:58:16,874 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-26 17:58:16,874 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:16,874 INFO ]: Analyzing trace with hash 886652682, now seen corresponding path program 18 times [2018-06-26 17:58:16,874 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:16,874 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:16,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:16,875 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:16,875 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:16,950 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:17,594 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:17,595 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:17,595 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:17,603 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:17,694 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-06-26 17:58:17,694 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:17,700 INFO ]: Computing forward predicates... [2018-06-26 17:58:17,855 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:17,875 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:17,875 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-26 17:58:17,875 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:58:17,875 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:58:17,875 INFO ]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:58:17,875 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2018-06-26 17:58:18,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:18,244 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 17:58:18,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:58:18,245 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-26 17:58:18,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:18,245 INFO ]: With dead ends: 26 [2018-06-26 17:58:18,245 INFO ]: Without dead ends: 26 [2018-06-26 17:58:18,246 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:58:18,246 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:58:18,247 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:58:18,247 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:58:18,248 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 17:58:18,248 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 17:58:18,248 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:18,248 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 17:58:18,248 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:58:18,248 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 17:58:18,249 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:58:18,249 INFO ]: Found error trace [2018-06-26 17:58:18,249 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-26 17:58:18,249 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:18,249 INFO ]: Analyzing trace with hash 1716103748, now seen corresponding path program 19 times [2018-06-26 17:58:18,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:18,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:18,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:18,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:18,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:18,320 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:18,838 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:18,839 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:18,839 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:18,844 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:18,951 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:18,964 INFO ]: Computing forward predicates... [2018-06-26 17:58:19,196 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:19,216 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:19,216 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-26 17:58:19,216 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:58:19,217 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:58:19,217 INFO ]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:58:19,217 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2018-06-26 17:58:19,492 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:19,492 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 17:58:19,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:58:19,495 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-26 17:58:19,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:19,495 INFO ]: With dead ends: 27 [2018-06-26 17:58:19,495 INFO ]: Without dead ends: 27 [2018-06-26 17:58:19,495 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 13 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:58:19,495 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:58:19,497 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:58:19,497 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:58:19,497 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 17:58:19,497 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 17:58:19,497 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:19,497 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 17:58:19,497 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:58:19,497 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 17:58:19,498 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:58:19,498 INFO ]: Found error trace [2018-06-26 17:58:19,498 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-26 17:58:19,498 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:19,498 INFO ]: Analyzing trace with hash 1659283018, now seen corresponding path program 20 times [2018-06-26 17:58:19,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:19,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:19,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:19,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:19,499 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:19,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:20,134 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:20,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:20,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:20,144 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:20,263 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:20,263 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:20,276 INFO ]: Computing forward predicates... [2018-06-26 17:58:20,516 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:20,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:20,569 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-26 17:58:20,569 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:58:20,570 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:58:20,570 INFO ]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:58:20,570 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2018-06-26 17:58:21,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:21,083 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 17:58:21,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:58:21,083 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 17:58:21,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:21,084 INFO ]: With dead ends: 28 [2018-06-26 17:58:21,084 INFO ]: Without dead ends: 28 [2018-06-26 17:58:21,084 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:58:21,084 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:58:21,085 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:58:21,085 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:58:21,086 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 17:58:21,086 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 17:58:21,086 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:21,086 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 17:58:21,086 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:58:21,086 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 17:58:21,086 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:58:21,086 INFO ]: Found error trace [2018-06-26 17:58:21,087 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-26 17:58:21,087 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:21,087 INFO ]: Analyzing trace with hash -102159612, now seen corresponding path program 21 times [2018-06-26 17:58:21,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:21,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:21,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:21,087 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:21,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:21,176 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:21,732 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:21,732 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:21,732 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:21,738 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:21,846 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 17:58:21,846 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:21,860 INFO ]: Computing forward predicates... [2018-06-26 17:58:22,100 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:22,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:22,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-26 17:58:22,120 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:58:22,120 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:58:22,120 INFO ]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:58:22,121 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2018-06-26 17:58:22,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:22,777 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 17:58:22,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:58:22,778 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 17:58:22,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:22,778 INFO ]: With dead ends: 29 [2018-06-26 17:58:22,778 INFO ]: Without dead ends: 29 [2018-06-26 17:58:22,778 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:58:22,778 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:58:22,780 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:58:22,780 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:58:22,780 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:58:22,780 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 17:58:22,781 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:22,781 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:58:22,781 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:58:22,781 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:58:22,781 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:58:22,781 INFO ]: Found error trace [2018-06-26 17:58:22,781 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-26 17:58:22,781 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:22,781 INFO ]: Analyzing trace with hash 1127693706, now seen corresponding path program 22 times [2018-06-26 17:58:22,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:22,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:22,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:22,787 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:22,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:22,886 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:23,514 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:23,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:23,514 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:23,520 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:23,665 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:23,665 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:23,682 INFO ]: Computing forward predicates... [2018-06-26 17:58:24,017 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:24,036 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:24,036 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-26 17:58:24,036 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:58:24,036 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:58:24,037 INFO ]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:58:24,037 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2018-06-26 17:58:24,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:24,418 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 17:58:24,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:58:24,418 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-26 17:58:24,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:24,419 INFO ]: With dead ends: 30 [2018-06-26 17:58:24,419 INFO ]: Without dead ends: 30 [2018-06-26 17:58:24,419 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 16 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:58:24,419 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:58:24,421 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:58:24,421 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:58:24,422 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 17:58:24,422 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 17:58:24,422 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:24,422 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 17:58:24,422 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:58:24,422 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 17:58:24,422 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:58:24,422 INFO ]: Found error trace [2018-06-26 17:58:24,422 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-26 17:58:24,422 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:24,422 INFO ]: Analyzing trace with hash 598440900, now seen corresponding path program 23 times [2018-06-26 17:58:24,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:24,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:24,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:24,423 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:24,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:24,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:25,204 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:25,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:25,204 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:25,212 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:25,345 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 17:58:25,345 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:25,359 INFO ]: Computing forward predicates... [2018-06-26 17:58:25,694 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:25,716 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:25,716 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-26 17:58:25,716 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:58:25,716 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:58:25,716 INFO ]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:58:25,716 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2018-06-26 17:58:26,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:26,202 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 17:58:26,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:58:26,202 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-26 17:58:26,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:26,202 INFO ]: With dead ends: 31 [2018-06-26 17:58:26,202 INFO ]: Without dead ends: 31 [2018-06-26 17:58:26,202 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:58:26,203 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:58:26,204 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:58:26,204 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:58:26,204 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 17:58:26,205 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 17:58:26,205 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:26,205 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 17:58:26,205 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:58:26,205 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 17:58:26,206 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:58:26,206 INFO ]: Found error trace [2018-06-26 17:58:26,206 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-26 17:58:26,206 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:26,206 INFO ]: Analyzing trace with hash 1371473098, now seen corresponding path program 24 times [2018-06-26 17:58:26,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:26,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:26,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:26,207 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:26,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:26,325 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:27,690 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:27,690 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:27,690 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:27,696 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:27,825 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-06-26 17:58:27,825 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:27,835 INFO ]: Computing forward predicates... [2018-06-26 17:58:28,217 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:28,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:28,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-26 17:58:28,237 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:58:28,237 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:58:28,237 INFO ]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:58:28,237 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2018-06-26 17:58:28,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:28,642 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 17:58:28,644 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:58:28,644 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-26 17:58:28,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:28,644 INFO ]: With dead ends: 32 [2018-06-26 17:58:28,644 INFO ]: Without dead ends: 32 [2018-06-26 17:58:28,645 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:58:28,645 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:58:28,647 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:58:28,647 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:58:28,647 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 17:58:28,647 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 17:58:28,647 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:28,647 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 17:58:28,647 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:58:28,647 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 17:58:28,648 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:58:28,648 INFO ]: Found error trace [2018-06-26 17:58:28,648 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-26 17:58:28,648 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:28,648 INFO ]: Analyzing trace with hash -434332540, now seen corresponding path program 25 times [2018-06-26 17:58:28,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:28,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:28,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:28,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:28,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:28,746 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:30,099 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:30,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:30,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:30,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:30,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:30,297 INFO ]: Computing forward predicates... [2018-06-26 17:58:30,701 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:30,721 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:30,721 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-26 17:58:30,721 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:58:30,721 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:58:30,721 INFO ]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:58:30,721 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-06-26 17:58:31,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:31,181 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 17:58:31,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:58:31,182 INFO ]: Start accepts. Automaton has 31 states. Word has length 31 [2018-06-26 17:58:31,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:31,182 INFO ]: With dead ends: 33 [2018-06-26 17:58:31,182 INFO ]: Without dead ends: 33 [2018-06-26 17:58:31,183 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:58:31,183 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:58:31,184 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:58:31,184 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:58:31,184 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 17:58:31,184 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 17:58:31,184 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:31,184 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 17:58:31,184 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:58:31,184 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 17:58:31,185 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:58:31,185 INFO ]: Found error trace [2018-06-26 17:58:31,185 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-26 17:58:31,185 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:31,185 INFO ]: Analyzing trace with hash -579732470, now seen corresponding path program 26 times [2018-06-26 17:58:31,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:31,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:31,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:31,186 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:31,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:31,257 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:31,899 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:31,899 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:31,899 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:31,906 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:32,081 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:32,081 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:32,097 INFO ]: Computing forward predicates... [2018-06-26 17:58:32,842 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:32,862 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:32,862 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-26 17:58:32,862 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:58:32,862 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:58:32,863 INFO ]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:58:32,863 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2018-06-26 17:58:33,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:33,348 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 17:58:33,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:58:33,349 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-26 17:58:33,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:33,350 INFO ]: With dead ends: 34 [2018-06-26 17:58:33,350 INFO ]: Without dead ends: 34 [2018-06-26 17:58:33,350 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 17 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:58:33,350 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:58:33,352 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:58:33,352 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:58:33,352 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 17:58:33,352 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 17:58:33,357 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:33,357 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 17:58:33,357 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:58:33,357 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 17:58:33,357 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:58:33,357 INFO ]: Found error trace [2018-06-26 17:58:33,357 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-26 17:58:33,357 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:33,357 INFO ]: Analyzing trace with hash -792163004, now seen corresponding path program 27 times [2018-06-26 17:58:33,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:33,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:33,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:33,358 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:33,358 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:33,428 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:35,160 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:35,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:35,160 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:35,179 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:35,368 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 17:58:35,369 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:35,380 INFO ]: Computing forward predicates... [2018-06-26 17:58:35,701 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:35,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:35,739 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-26 17:58:35,739 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:58:35,739 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:58:35,739 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:35,740 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-26 17:58:36,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:36,251 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 17:58:36,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:58:36,251 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-26 17:58:36,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:36,252 INFO ]: With dead ends: 35 [2018-06-26 17:58:36,252 INFO ]: Without dead ends: 35 [2018-06-26 17:58:36,252 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:36,252 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:58:36,254 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:58:36,254 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:58:36,254 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 17:58:36,254 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 17:58:36,254 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:36,254 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 17:58:36,254 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:58:36,254 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 17:58:36,255 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:58:36,255 INFO ]: Found error trace [2018-06-26 17:58:36,255 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-26 17:58:36,255 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:36,255 INFO ]: Analyzing trace with hash 1212425034, now seen corresponding path program 28 times [2018-06-26 17:58:36,255 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:36,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:36,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:36,255 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:36,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:36,351 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:37,961 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:37,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:37,961 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:37,967 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:38,207 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:38,207 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:38,229 INFO ]: Computing forward predicates... [2018-06-26 17:58:38,529 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:38,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:38,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-26 17:58:38,549 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:58:38,550 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:58:38,550 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:58:38,550 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-26 17:58:39,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:39,071 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 17:58:39,071 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:58:39,071 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-26 17:58:39,071 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:39,071 INFO ]: With dead ends: 36 [2018-06-26 17:58:39,071 INFO ]: Without dead ends: 36 [2018-06-26 17:58:39,071 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:58:39,072 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:58:39,073 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:58:39,073 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:58:39,073 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 17:58:39,074 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 17:58:39,074 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:39,074 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 17:58:39,074 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:58:39,074 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 17:58:39,074 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:58:39,074 INFO ]: Found error trace [2018-06-26 17:58:39,074 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-26 17:58:39,074 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:39,074 INFO ]: Analyzing trace with hash -1069855228, now seen corresponding path program 29 times [2018-06-26 17:58:39,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:39,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:39,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:39,077 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:39,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:39,164 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:40,501 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:40,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:40,501 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:40,506 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:40,666 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 17:58:40,666 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:40,681 INFO ]: Computing forward predicates... [2018-06-26 17:58:41,012 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:41,032 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:41,032 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-26 17:58:41,032 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:58:41,032 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:58:41,033 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:58:41,033 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-26 17:58:41,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:41,649 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 17:58:41,650 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:58:41,650 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-26 17:58:41,650 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:41,650 INFO ]: With dead ends: 37 [2018-06-26 17:58:41,650 INFO ]: Without dead ends: 37 [2018-06-26 17:58:41,650 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:58:41,650 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:58:41,652 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:58:41,652 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:58:41,652 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 17:58:41,652 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 17:58:41,653 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:41,653 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 17:58:41,653 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:58:41,653 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 17:58:41,653 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:58:41,653 INFO ]: Found error trace [2018-06-26 17:58:41,653 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-26 17:58:41,653 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:41,653 INFO ]: Analyzing trace with hash 1193900682, now seen corresponding path program 30 times [2018-06-26 17:58:41,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:41,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:41,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:41,654 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:41,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:41,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:42,892 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:42,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:42,892 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:42,899 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:43,062 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-06-26 17:58:43,062 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:43,074 INFO ]: Computing forward predicates... [2018-06-26 17:58:43,605 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:43,625 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:43,625 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-26 17:58:43,625 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:58:43,626 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:58:43,626 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:58:43,627 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-26 17:58:44,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:44,282 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 17:58:44,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:58:44,282 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-26 17:58:44,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:44,282 INFO ]: With dead ends: 38 [2018-06-26 17:58:44,282 INFO ]: Without dead ends: 38 [2018-06-26 17:58:44,282 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 22 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:58:44,283 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:58:44,284 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:58:44,284 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:58:44,284 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 17:58:44,284 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 17:58:44,284 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:44,284 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 17:58:44,284 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:58:44,284 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 17:58:44,284 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:58:44,284 INFO ]: Found error trace [2018-06-26 17:58:44,284 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-26 17:58:44,284 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:44,284 INFO ]: Analyzing trace with hash -1644110140, now seen corresponding path program 31 times [2018-06-26 17:58:44,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:44,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:44,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:44,285 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:44,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:44,449 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:46,477 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:46,477 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:46,477 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:46,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:46,725 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:46,758 INFO ]: Computing forward predicates... [2018-06-26 17:58:47,345 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:47,365 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:47,365 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-26 17:58:47,365 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:58:47,365 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:58:47,366 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:58:47,366 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-26 17:58:48,109 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:48,109 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 17:58:48,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:58:48,109 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-26 17:58:48,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:48,109 INFO ]: With dead ends: 39 [2018-06-26 17:58:48,109 INFO ]: Without dead ends: 39 [2018-06-26 17:58:48,109 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:58:48,109 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:58:48,110 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:58:48,110 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:58:48,111 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 17:58:48,111 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 17:58:48,111 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:48,111 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 17:58:48,111 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:58:48,111 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 17:58:48,111 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:58:48,111 INFO ]: Found error trace [2018-06-26 17:58:48,111 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-26 17:58:48,111 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:48,111 INFO ]: Analyzing trace with hash 571867594, now seen corresponding path program 32 times [2018-06-26 17:58:48,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:48,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:48,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:48,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:48,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:48,224 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:49,193 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:49,193 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:49,193 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:49,199 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:49,453 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:49,453 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:49,475 INFO ]: Computing forward predicates... [2018-06-26 17:58:49,885 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:49,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:49,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-26 17:58:49,906 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:58:49,906 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:58:49,907 INFO ]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:58:49,907 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2018-06-26 17:58:50,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:50,659 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 17:58:50,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:58:50,659 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-26 17:58:50,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:50,660 INFO ]: With dead ends: 40 [2018-06-26 17:58:50,660 INFO ]: Without dead ends: 40 [2018-06-26 17:58:50,660 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:58:50,660 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:58:50,661 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:58:50,661 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:58:50,662 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 17:58:50,662 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 17:58:50,662 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:50,662 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 17:58:50,662 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:58:50,662 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 17:58:50,662 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:58:50,662 INFO ]: Found error trace [2018-06-26 17:58:50,662 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-26 17:58:50,662 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:50,662 INFO ]: Analyzing trace with hash 547700612, now seen corresponding path program 33 times [2018-06-26 17:58:50,662 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:50,662 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:50,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:50,663 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:50,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:50,765 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:52,032 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:52,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:52,032 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:52,037 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:52,217 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 17:58:52,217 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:52,246 INFO ]: Computing forward predicates... [2018-06-26 17:58:53,047 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:53,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:53,068 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-26 17:58:53,068 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:58:53,068 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:58:53,068 INFO ]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:58:53,068 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2018-06-26 17:58:53,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:53,880 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-26 17:58:53,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:58:53,880 INFO ]: Start accepts. Automaton has 38 states. Word has length 39 [2018-06-26 17:58:53,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:53,880 INFO ]: With dead ends: 41 [2018-06-26 17:58:53,880 INFO ]: Without dead ends: 41 [2018-06-26 17:58:53,881 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 18 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:58:53,881 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:58:53,882 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:58:53,882 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:58:53,882 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-26 17:58:53,882 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-26 17:58:53,882 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:53,882 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-26 17:58:53,882 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:58:53,882 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-26 17:58:53,882 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:58:53,882 INFO ]: Found error trace [2018-06-26 17:58:53,882 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-26 17:58:53,882 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:53,882 INFO ]: Analyzing trace with hash -201475830, now seen corresponding path program 34 times [2018-06-26 17:58:53,882 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:53,882 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:53,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:53,883 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:53,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:54,021 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:55,070 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:55,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:55,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:55,076 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:55,360 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:55,360 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:55,391 INFO ]: Computing forward predicates... [2018-06-26 17:58:55,955 INFO ]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:55,975 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:55,975 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-26 17:58:55,975 INFO ]: Interpolant automaton has 39 states [2018-06-26 17:58:55,975 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 17:58:55,976 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:58:55,976 INFO ]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. Received shutdown request... [2018-06-26 17:58:56,127 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:58:56,127 WARN ]: Verification canceled [2018-06-26 17:58:56,130 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:58:56,131 WARN ]: Timeout [2018-06-26 17:58:56,132 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:58:56 BasicIcfg [2018-06-26 17:58:56,132 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:58:56,132 INFO ]: Toolchain (without parser) took 57598.11 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 698.9 MB). Free memory was 263.7 MB in the beginning and 288.3 MB in the end (delta: -24.6 MB). Peak memory consumption was 674.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,133 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:58:56,133 INFO ]: ChcToBoogie took 63.06 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,134 INFO ]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,134 INFO ]: RCFGBuilder took 250.45 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 249.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,134 INFO ]: BlockEncodingV2 took 88.98 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,137 INFO ]: TraceAbstraction took 57140.77 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 698.9 MB). Free memory was 247.7 MB in the beginning and 288.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 658.3 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:56,139 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 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 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.06 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 250.45 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 249.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 88.98 ms. Allocated memory is still 309.3 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57140.77 ms. Allocated memory was 309.3 MB in the beginning and 1.0 GB in the end (delta: 698.9 MB). Free memory was 247.7 MB in the beginning and 288.3 MB in the end (delta: -40.5 MB). Peak memory consumption was 658.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (41states) and interpolant automaton (currently 9 states, 39 states before enhancement), while ReachableStatesComputation was computing reachable states (8 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.0s OverallTime, 37 OverallIterations, 35 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 185 SDtfs, 0 SDslu, 1969 SDs, 0 SdLazy, 16685 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1507 GetRequests, 439 SyntacticMatches, 364 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 32.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 1617 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 230 NumberOfCheckSat, 1545 ConstructedInterpolants, 0 QuantifiedInterpolants, 1071984 SizeOfPredicates, 208 NumberOfNonLiveVariables, 26413 ConjunctsInSsa, 11671 ConjunctsInUnsatCore, 72 InterpolantComputations, 3 PerfectInterpolantSequences, 2/15531 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-58-56-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-58-56-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-58-56-151.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-58-56-151.csv Completed graceful shutdown