java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy0.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 22:04:46,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 22:04:46,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 22:04:46,535 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 22:04:46,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 22:04:46,536 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 22:04:46,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 22:04:46,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 22:04:46,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 22:04:46,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 22:04:46,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 22:04:46,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 22:04:46,545 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 22:04:46,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 22:04:46,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 22:04:46,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 22:04:46,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 22:04:46,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 22:04:46,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 22:04:46,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 22:04:46,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 22:04:46,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 22:04:46,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 22:04:46,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 22:04:46,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 22:04:46,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 22:04:46,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 22:04:46,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 22:04:46,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 22:04:46,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 22:04:46,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 22:04:46,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 22:04:46,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 22:04:46,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 22:04:46,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 22:04:46,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 22:04:46,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 22:04:46,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 22:04:46,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 22:04:46,589 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 22:04:46,589 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 22:04:46,590 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 22:04:46,590 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 22:04:46,590 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 22:04:46,594 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 22:04:46,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 22:04:46,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 22:04:46,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 22:04:46,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 22:04:46,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:04:46,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 22:04:46,595 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 22:04:46,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 22:04:46,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 22:04:46,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 22:04:46,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 22:04:46,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 22:04:46,596 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 22:04:46,599 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 22:04:46,599 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 22:04:46,647 INFO ]: Repository-Root is: /tmp [2018-06-26 22:04:46,664 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 22:04:46,669 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 22:04:46,670 INFO ]: Initializing SmtParser... [2018-06-26 22:04:46,671 INFO ]: SmtParser initialized [2018-06-26 22:04:46,671 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy0.c.smt2 [2018-06-26 22:04:46,673 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 22:04:46,758 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy0.c.smt2 unknown [2018-06-26 22:04:46,958 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/xy0.c.smt2 [2018-06-26 22:04:46,963 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 22:04:46,969 INFO ]: Walking toolchain with 5 elements. [2018-06-26 22:04:46,970 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 22:04:46,970 INFO ]: Initializing ChcToBoogie... [2018-06-26 22:04:46,970 INFO ]: ChcToBoogie initialized [2018-06-26 22:04:46,973 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:04:46" (1/1) ... [2018-06-26 22:04:47,024 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47 Unit [2018-06-26 22:04:47,025 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 22:04:47,025 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 22:04:47,025 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 22:04:47,025 INFO ]: Boogie Preprocessor initialized [2018-06-26 22:04:47,045 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,045 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,050 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,051 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,053 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,055 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,056 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,057 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 22:04:47,058 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 22:04:47,058 INFO ]: Initializing RCFGBuilder... [2018-06-26 22:04:47,058 INFO ]: RCFGBuilder initialized [2018-06-26 22:04:47,059 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 22:04:47,070 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 22:04:47,070 INFO ]: Found specification of procedure gotoProc [2018-06-26 22:04:47,070 INFO ]: Found implementation of procedure gotoProc [2018-06-26 22:04:47,070 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 22:04:47,070 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 22:04:47,070 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:04:47,302 INFO ]: Using library mode [2018-06-26 22:04:47,302 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:04:47 BoogieIcfgContainer [2018-06-26 22:04:47,302 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 22:04:47,303 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 22:04:47,303 INFO ]: Initializing BlockEncodingV2... [2018-06-26 22:04:47,304 INFO ]: BlockEncodingV2 initialized [2018-06-26 22:04:47,304 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:04:47" (1/1) ... [2018-06-26 22:04:47,320 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 22:04:47,321 INFO ]: Using Remove infeasible edges [2018-06-26 22:04:47,322 INFO ]: Using Maximize final states [2018-06-26 22:04:47,322 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 22:04:47,322 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 22:04:47,324 INFO ]: Using Remove sink states [2018-06-26 22:04:47,325 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 22:04:47,325 INFO ]: Using Use SBE [2018-06-26 22:04:47,334 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 22:04:52,099 INFO ]: SBE split 1 edges [2018-06-26 22:04:52,109 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 22:04:52,110 INFO ]: 0 new accepting states [2018-06-26 22:04:52,145 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 22:04:52,147 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:04:52,155 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 22:04:52,155 INFO ]: 0 new accepting states [2018-06-26 22:04:52,156 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 22:04:52,156 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:04:52,163 INFO ]: Encoded RCFG 6 locations, 127 edges [2018-06-26 22:04:52,163 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:04:52 BasicIcfg [2018-06-26 22:04:52,163 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 22:04:52,165 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 22:04:52,165 INFO ]: Initializing TraceAbstraction... [2018-06-26 22:04:52,168 INFO ]: TraceAbstraction initialized [2018-06-26 22:04:52,168 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:04:46" (1/4) ... [2018-06-26 22:04:52,169 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb9638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 10:04:52, skipping insertion in model container [2018-06-26 22:04:52,169 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:04:47" (2/4) ... [2018-06-26 22:04:52,169 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb9638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 10:04:52, skipping insertion in model container [2018-06-26 22:04:52,169 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:04:47" (3/4) ... [2018-06-26 22:04:52,170 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb9638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:04:52, skipping insertion in model container [2018-06-26 22:04:52,170 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:04:52" (4/4) ... [2018-06-26 22:04:52,171 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 22:04:52,179 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 22:04:52,186 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 22:04:52,225 INFO ]: Using default assertion order modulation [2018-06-26 22:04:52,226 INFO ]: Interprodecural is true [2018-06-26 22:04:52,226 INFO ]: Hoare is false [2018-06-26 22:04:52,226 INFO ]: Compute interpolants for FPandBP [2018-06-26 22:04:52,226 INFO ]: Backedges is TWOTRACK [2018-06-26 22:04:52,226 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 22:04:52,226 INFO ]: Difference is false [2018-06-26 22:04:52,226 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 22:04:52,226 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 22:04:52,238 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 22:04:52,247 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:04:52,247 INFO ]: Found error trace [2018-06-26 22:04:52,248 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:04:52,249 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:52,252 INFO ]: Analyzing trace with hash 39154306, now seen corresponding path program 1 times [2018-06-26 22:04:52,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:52,255 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:52,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:52,288 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:52,288 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:52,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:52,397 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:04:52,398 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:52,398 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:52,400 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:52,411 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:52,411 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:52,413 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 22:04:53,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:53,490 INFO ]: Finished difference Result 7 states and 195 transitions. [2018-06-26 22:04:53,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:53,491 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:04:53,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:53,500 INFO ]: With dead ends: 7 [2018-06-26 22:04:53,500 INFO ]: Without dead ends: 7 [2018-06-26 22:04:53,502 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:53,517 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 22:04:53,533 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 22:04:53,534 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:04:53,535 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 195 transitions. [2018-06-26 22:04:53,536 INFO ]: Start accepts. Automaton has 7 states and 195 transitions. Word has length 5 [2018-06-26 22:04:53,536 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:53,536 INFO ]: Abstraction has 7 states and 195 transitions. [2018-06-26 22:04:53,536 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:53,536 INFO ]: Start isEmpty. Operand 7 states and 195 transitions. [2018-06-26 22:04:53,537 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:04:53,537 INFO ]: Found error trace [2018-06-26 22:04:53,537 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:04:53,537 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:53,537 INFO ]: Analyzing trace with hash 1213783645, now seen corresponding path program 1 times [2018-06-26 22:04:53,537 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:53,538 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:53,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:53,539 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:53,539 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:53,548 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:53,606 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:04:53,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:53,607 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:53,608 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:53,608 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:53,608 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:53,608 INFO ]: Start difference. First operand 7 states and 195 transitions. Second operand 3 states. [2018-06-26 22:04:54,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:54,301 INFO ]: Finished difference Result 9 states and 299 transitions. [2018-06-26 22:04:54,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:54,301 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 22:04:54,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:54,303 INFO ]: With dead ends: 9 [2018-06-26 22:04:54,303 INFO ]: Without dead ends: 9 [2018-06-26 22:04:54,303 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:54,303 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:04:54,308 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 22:04:54,308 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:04:54,309 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 299 transitions. [2018-06-26 22:04:54,309 INFO ]: Start accepts. Automaton has 9 states and 299 transitions. Word has length 6 [2018-06-26 22:04:54,309 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:54,309 INFO ]: Abstraction has 9 states and 299 transitions. [2018-06-26 22:04:54,309 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:54,309 INFO ]: Start isEmpty. Operand 9 states and 299 transitions. [2018-06-26 22:04:54,310 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:04:54,310 INFO ]: Found error trace [2018-06-26 22:04:54,310 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:04:54,310 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:54,310 INFO ]: Analyzing trace with hash 1212145140, now seen corresponding path program 1 times [2018-06-26 22:04:54,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:54,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:54,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:54,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:54,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:54,317 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:54,344 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:04:54,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:54,345 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:54,345 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:54,345 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:54,345 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:54,345 INFO ]: Start difference. First operand 9 states and 299 transitions. Second operand 3 states. [2018-06-26 22:04:54,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:54,667 INFO ]: Finished difference Result 13 states and 455 transitions. [2018-06-26 22:04:54,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:54,668 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 22:04:54,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:54,669 INFO ]: With dead ends: 13 [2018-06-26 22:04:54,669 INFO ]: Without dead ends: 13 [2018-06-26 22:04:54,670 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:54,670 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 22:04:54,675 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 22:04:54,676 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 22:04:54,677 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 455 transitions. [2018-06-26 22:04:54,677 INFO ]: Start accepts. Automaton has 13 states and 455 transitions. Word has length 6 [2018-06-26 22:04:54,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:54,677 INFO ]: Abstraction has 13 states and 455 transitions. [2018-06-26 22:04:54,677 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:54,677 INFO ]: Start isEmpty. Operand 13 states and 455 transitions. [2018-06-26 22:04:54,678 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:04:54,678 INFO ]: Found error trace [2018-06-26 22:04:54,678 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:54,678 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:54,678 INFO ]: Analyzing trace with hash 836500874, now seen corresponding path program 1 times [2018-06-26 22:04:54,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:54,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:54,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:54,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:54,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:54,693 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:54,733 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:04:54,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:54,733 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:54,734 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:54,734 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:54,734 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:54,734 INFO ]: Start difference. First operand 13 states and 455 transitions. Second operand 3 states. [2018-06-26 22:04:55,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:55,161 INFO ]: Finished difference Result 22 states and 776 transitions. [2018-06-26 22:04:55,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:55,162 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 22:04:55,162 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:55,164 INFO ]: With dead ends: 22 [2018-06-26 22:04:55,164 INFO ]: Without dead ends: 22 [2018-06-26 22:04:55,165 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,165 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 22:04:55,173 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 22:04:55,173 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 22:04:55,175 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 775 transitions. [2018-06-26 22:04:55,175 INFO ]: Start accepts. Automaton has 21 states and 775 transitions. Word has length 8 [2018-06-26 22:04:55,175 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:55,175 INFO ]: Abstraction has 21 states and 775 transitions. [2018-06-26 22:04:55,175 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:55,175 INFO ]: Start isEmpty. Operand 21 states and 775 transitions. [2018-06-26 22:04:55,176 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:04:55,176 INFO ]: Found error trace [2018-06-26 22:04:55,176 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:55,176 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:55,176 INFO ]: Analyzing trace with hash 834772996, now seen corresponding path program 1 times [2018-06-26 22:04:55,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:55,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:55,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,177 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:55,177 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,186 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:55,207 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:04:55,207 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:55,207 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:55,207 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:55,207 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:55,207 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,207 INFO ]: Start difference. First operand 21 states and 775 transitions. Second operand 3 states. [2018-06-26 22:04:55,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:55,470 INFO ]: Finished difference Result 38 states and 1271 transitions. [2018-06-26 22:04:55,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:55,471 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 22:04:55,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:55,473 INFO ]: With dead ends: 38 [2018-06-26 22:04:55,474 INFO ]: Without dead ends: 38 [2018-06-26 22:04:55,474 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,474 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 22:04:55,488 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-26 22:04:55,488 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 22:04:55,490 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1270 transitions. [2018-06-26 22:04:55,490 INFO ]: Start accepts. Automaton has 37 states and 1270 transitions. Word has length 8 [2018-06-26 22:04:55,490 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:55,490 INFO ]: Abstraction has 37 states and 1270 transitions. [2018-06-26 22:04:55,490 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:55,490 INFO ]: Start isEmpty. Operand 37 states and 1270 transitions. [2018-06-26 22:04:55,491 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:04:55,491 INFO ]: Found error trace [2018-06-26 22:04:55,491 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:55,492 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:55,492 INFO ]: Analyzing trace with hash 889141571, now seen corresponding path program 1 times [2018-06-26 22:04:55,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:55,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:55,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:55,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:55,514 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 22:04:55,514 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:55,514 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:55,514 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:55,515 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:55,515 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,515 INFO ]: Start difference. First operand 37 states and 1270 transitions. Second operand 3 states. [2018-06-26 22:04:55,933 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:55,933 INFO ]: Finished difference Result 35 states and 779 transitions. [2018-06-26 22:04:55,933 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:55,933 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 22:04:55,933 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:55,934 INFO ]: With dead ends: 35 [2018-06-26 22:04:55,934 INFO ]: Without dead ends: 35 [2018-06-26 22:04:55,935 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,935 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 22:04:55,940 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 22:04:55,940 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 22:04:55,941 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 779 transitions. [2018-06-26 22:04:55,941 INFO ]: Start accepts. Automaton has 35 states and 779 transitions. Word has length 8 [2018-06-26 22:04:55,941 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:55,941 INFO ]: Abstraction has 35 states and 779 transitions. [2018-06-26 22:04:55,941 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:55,942 INFO ]: Start isEmpty. Operand 35 states and 779 transitions. [2018-06-26 22:04:55,942 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:04:55,942 INFO ]: Found error trace [2018-06-26 22:04:55,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:55,943 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:55,943 INFO ]: Analyzing trace with hash 907045962, now seen corresponding path program 1 times [2018-06-26 22:04:55,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:55,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:55,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:55,944 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:55,951 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:55,966 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 22:04:55,966 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:55,966 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:55,966 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:55,966 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:55,966 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:55,967 INFO ]: Start difference. First operand 35 states and 779 transitions. Second operand 3 states. [2018-06-26 22:04:57,065 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:57,065 INFO ]: Finished difference Result 43 states and 872 transitions. [2018-06-26 22:04:57,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:57,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 22:04:57,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:57,068 INFO ]: With dead ends: 43 [2018-06-26 22:04:57,068 INFO ]: Without dead ends: 39 [2018-06-26 22:04:57,069 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,069 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 22:04:57,074 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-06-26 22:04:57,074 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 22:04:57,075 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 323 transitions. [2018-06-26 22:04:57,075 INFO ]: Start accepts. Automaton has 36 states and 323 transitions. Word has length 8 [2018-06-26 22:04:57,075 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:57,075 INFO ]: Abstraction has 36 states and 323 transitions. [2018-06-26 22:04:57,075 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:57,075 INFO ]: Start isEmpty. Operand 36 states and 323 transitions. [2018-06-26 22:04:57,076 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 22:04:57,076 INFO ]: Found error trace [2018-06-26 22:04:57,076 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:57,076 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:57,077 INFO ]: Analyzing trace with hash 771656828, now seen corresponding path program 1 times [2018-06-26 22:04:57,077 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:57,077 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:57,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,077 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:57,077 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,094 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:57,123 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 22:04:57,123 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:57,144 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:57,144 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:57,144 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:57,144 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,144 INFO ]: Start difference. First operand 36 states and 323 transitions. Second operand 3 states. [2018-06-26 22:04:57,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:57,241 INFO ]: Finished difference Result 37 states and 227 transitions. [2018-06-26 22:04:57,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:57,242 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 22:04:57,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:57,243 INFO ]: With dead ends: 37 [2018-06-26 22:04:57,243 INFO ]: Without dead ends: 36 [2018-06-26 22:04:57,243 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,243 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 22:04:57,246 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 22:04:57,247 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 22:04:57,247 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 226 transitions. [2018-06-26 22:04:57,247 INFO ]: Start accepts. Automaton has 36 states and 226 transitions. Word has length 13 [2018-06-26 22:04:57,247 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:57,247 INFO ]: Abstraction has 36 states and 226 transitions. [2018-06-26 22:04:57,247 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:57,248 INFO ]: Start isEmpty. Operand 36 states and 226 transitions. [2018-06-26 22:04:57,248 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 22:04:57,248 INFO ]: Found error trace [2018-06-26 22:04:57,248 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:57,248 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:57,248 INFO ]: Analyzing trace with hash 2100209090, now seen corresponding path program 1 times [2018-06-26 22:04:57,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:57,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:57,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:57,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,268 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:57,330 INFO ]: Checked inductivity of 45 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 22:04:57,330 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:57,330 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:57,330 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:57,330 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:57,330 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,330 INFO ]: Start difference. First operand 36 states and 226 transitions. Second operand 3 states. [2018-06-26 22:04:57,658 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:57,658 INFO ]: Finished difference Result 48 states and 319 transitions. [2018-06-26 22:04:57,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:57,659 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 22:04:57,659 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:57,659 INFO ]: With dead ends: 48 [2018-06-26 22:04:57,659 INFO ]: Without dead ends: 44 [2018-06-26 22:04:57,660 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,660 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 22:04:57,668 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-06-26 22:04:57,668 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 22:04:57,669 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 243 transitions. [2018-06-26 22:04:57,669 INFO ]: Start accepts. Automaton has 40 states and 243 transitions. Word has length 14 [2018-06-26 22:04:57,669 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:57,669 INFO ]: Abstraction has 40 states and 243 transitions. [2018-06-26 22:04:57,669 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:57,669 INFO ]: Start isEmpty. Operand 40 states and 243 transitions. [2018-06-26 22:04:57,670 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 22:04:57,670 INFO ]: Found error trace [2018-06-26 22:04:57,670 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:57,670 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:57,670 INFO ]: Analyzing trace with hash 1319298273, now seen corresponding path program 1 times [2018-06-26 22:04:57,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:57,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:57,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:57,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,687 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:57,720 INFO ]: Checked inductivity of 55 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 22:04:57,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:57,720 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:04:57,720 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:04:57,720 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:04:57,720 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,720 INFO ]: Start difference. First operand 40 states and 243 transitions. Second operand 3 states. [2018-06-26 22:04:57,919 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:57,920 INFO ]: Finished difference Result 40 states and 187 transitions. [2018-06-26 22:04:57,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:04:57,922 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 22:04:57,922 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:57,923 INFO ]: With dead ends: 40 [2018-06-26 22:04:57,923 INFO ]: Without dead ends: 40 [2018-06-26 22:04:57,923 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:04:57,923 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 22:04:57,926 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-26 22:04:57,926 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 22:04:57,927 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 162 transitions. [2018-06-26 22:04:57,927 INFO ]: Start accepts. Automaton has 34 states and 162 transitions. Word has length 15 [2018-06-26 22:04:57,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:57,927 INFO ]: Abstraction has 34 states and 162 transitions. [2018-06-26 22:04:57,927 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:04:57,927 INFO ]: Start isEmpty. Operand 34 states and 162 transitions. [2018-06-26 22:04:57,928 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 22:04:57,928 INFO ]: Found error trace [2018-06-26 22:04:57,928 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:57,930 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:57,930 INFO ]: Analyzing trace with hash -1257946680, now seen corresponding path program 1 times [2018-06-26 22:04:57,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:57,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:57,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:57,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:57,956 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:57,997 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 22:04:57,997 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:04:57,997 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 22:04:57,997 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:04:57,997 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:04:57,997 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:04:57,997 INFO ]: Start difference. First operand 34 states and 162 transitions. Second operand 4 states. [2018-06-26 22:04:58,145 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:58,145 INFO ]: Finished difference Result 62 states and 282 transitions. [2018-06-26 22:04:58,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:04:58,145 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-26 22:04:58,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:58,146 INFO ]: With dead ends: 62 [2018-06-26 22:04:58,146 INFO ]: Without dead ends: 61 [2018-06-26 22:04:58,146 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:04:58,146 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 22:04:58,151 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-06-26 22:04:58,151 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 22:04:58,151 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 246 transitions. [2018-06-26 22:04:58,152 INFO ]: Start accepts. Automaton has 50 states and 246 transitions. Word has length 18 [2018-06-26 22:04:58,152 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:58,152 INFO ]: Abstraction has 50 states and 246 transitions. [2018-06-26 22:04:58,152 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:04:58,152 INFO ]: Start isEmpty. Operand 50 states and 246 transitions. [2018-06-26 22:04:58,153 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 22:04:58,153 INFO ]: Found error trace [2018-06-26 22:04:58,153 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:58,153 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:58,153 INFO ]: Analyzing trace with hash 1204434509, now seen corresponding path program 1 times [2018-06-26 22:04:58,153 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:58,153 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:58,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:58,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:58,154 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:58,180 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:58,342 INFO ]: Checked inductivity of 153 backedges. 98 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 22:04:58,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:04:58,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:04:58,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:58,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:04:58,455 INFO ]: Computing forward predicates... [2018-06-26 22:04:58,499 INFO ]: Checked inductivity of 153 backedges. 98 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 22:04:58,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:04:58,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 22:04:58,534 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:04:58,534 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:04:58,534 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:04:58,534 INFO ]: Start difference. First operand 50 states and 246 transitions. Second operand 4 states. [2018-06-26 22:04:59,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:04:59,892 INFO ]: Finished difference Result 77 states and 372 transitions. [2018-06-26 22:04:59,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:04:59,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-26 22:04:59,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:04:59,893 INFO ]: With dead ends: 77 [2018-06-26 22:04:59,893 INFO ]: Without dead ends: 72 [2018-06-26 22:04:59,893 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:04:59,893 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 22:04:59,900 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-06-26 22:04:59,900 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 22:04:59,901 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 289 transitions. [2018-06-26 22:04:59,901 INFO ]: Start accepts. Automaton has 59 states and 289 transitions. Word has length 22 [2018-06-26 22:04:59,901 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:04:59,901 INFO ]: Abstraction has 59 states and 289 transitions. [2018-06-26 22:04:59,901 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:04:59,902 INFO ]: Start isEmpty. Operand 59 states and 289 transitions. [2018-06-26 22:04:59,905 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 22:04:59,905 INFO ]: Found error trace [2018-06-26 22:04:59,905 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:04:59,905 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:04:59,905 INFO ]: Analyzing trace with hash -324953118, now seen corresponding path program 1 times [2018-06-26 22:04:59,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:04:59,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:04:59,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:59,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:04:59,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:04:59,943 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:00,004 INFO ]: Checked inductivity of 231 backedges. 121 proven. 59 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 22:05:00,004 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:00,004 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:00,012 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:00,082 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:00,087 INFO ]: Computing forward predicates... [2018-06-26 22:05:00,108 INFO ]: Checked inductivity of 231 backedges. 121 proven. 59 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 22:05:00,140 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:00,140 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 22:05:00,140 INFO ]: Interpolant automaton has 5 states [2018-06-26 22:05:00,140 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 22:05:00,140 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:05:00,140 INFO ]: Start difference. First operand 59 states and 289 transitions. Second operand 5 states. [2018-06-26 22:05:00,409 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:00,409 INFO ]: Finished difference Result 106 states and 529 transitions. [2018-06-26 22:05:00,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 22:05:00,410 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-26 22:05:00,410 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:00,411 INFO ]: With dead ends: 106 [2018-06-26 22:05:00,411 INFO ]: Without dead ends: 105 [2018-06-26 22:05:00,411 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:05:00,411 INFO ]: Start minimizeSevpa. Operand 105 states. [2018-06-26 22:05:00,418 INFO ]: Finished minimizeSevpa. Reduced states from 105 to 79. [2018-06-26 22:05:00,418 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 22:05:00,419 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 416 transitions. [2018-06-26 22:05:00,419 INFO ]: Start accepts. Automaton has 79 states and 416 transitions. Word has length 26 [2018-06-26 22:05:00,419 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:00,419 INFO ]: Abstraction has 79 states and 416 transitions. [2018-06-26 22:05:00,419 INFO ]: Interpolant automaton has 5 states. [2018-06-26 22:05:00,419 INFO ]: Start isEmpty. Operand 79 states and 416 transitions. [2018-06-26 22:05:00,420 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 22:05:00,420 INFO ]: Found error trace [2018-06-26 22:05:00,420 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:00,420 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:00,421 INFO ]: Analyzing trace with hash -2112912916, now seen corresponding path program 2 times [2018-06-26 22:05:00,421 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:00,421 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:00,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:00,421 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:00,421 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:00,433 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:00,501 INFO ]: Checked inductivity of 253 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-06-26 22:05:00,501 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:05:00,501 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:05:00,501 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:05:00,501 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:05:00,501 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:05:00,502 INFO ]: Start difference. First operand 79 states and 416 transitions. Second operand 3 states. [2018-06-26 22:05:00,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:00,577 INFO ]: Finished difference Result 61 states and 236 transitions. [2018-06-26 22:05:00,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:05:00,577 INFO ]: Start accepts. Automaton has 3 states. Word has length 27 [2018-06-26 22:05:00,577 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:00,577 INFO ]: With dead ends: 61 [2018-06-26 22:05:00,577 INFO ]: Without dead ends: 39 [2018-06-26 22:05:00,577 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:05:00,578 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 22:05:00,579 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-06-26 22:05:00,580 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 22:05:00,580 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2018-06-26 22:05:00,580 INFO ]: Start accepts. Automaton has 36 states and 102 transitions. Word has length 27 [2018-06-26 22:05:00,580 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:00,580 INFO ]: Abstraction has 36 states and 102 transitions. [2018-06-26 22:05:00,580 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:05:00,580 INFO ]: Start isEmpty. Operand 36 states and 102 transitions. [2018-06-26 22:05:00,580 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 22:05:00,580 INFO ]: Found error trace [2018-06-26 22:05:00,580 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:00,581 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:00,581 INFO ]: Analyzing trace with hash 2041083162, now seen corresponding path program 3 times [2018-06-26 22:05:00,581 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:00,581 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:00,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:00,581 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:00,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:00,603 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:00,714 INFO ]: Checked inductivity of 325 backedges. 198 proven. 59 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-26 22:05:00,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:00,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:00,731 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:05:00,884 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-06-26 22:05:00,884 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:00,889 INFO ]: Computing forward predicates... [2018-06-26 22:05:00,909 INFO ]: Checked inductivity of 325 backedges. 198 proven. 59 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-26 22:05:00,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:00,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 22:05:00,941 INFO ]: Interpolant automaton has 5 states [2018-06-26 22:05:00,941 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 22:05:00,941 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:05:00,941 INFO ]: Start difference. First operand 36 states and 102 transitions. Second operand 5 states. [2018-06-26 22:05:01,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:01,221 INFO ]: Finished difference Result 47 states and 135 transitions. [2018-06-26 22:05:01,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 22:05:01,221 INFO ]: Start accepts. Automaton has 5 states. Word has length 30 [2018-06-26 22:05:01,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:01,221 INFO ]: With dead ends: 47 [2018-06-26 22:05:01,221 INFO ]: Without dead ends: 46 [2018-06-26 22:05:01,222 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:05:01,222 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 22:05:01,224 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-06-26 22:05:01,224 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 22:05:01,224 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 113 transitions. [2018-06-26 22:05:01,224 INFO ]: Start accepts. Automaton has 40 states and 113 transitions. Word has length 30 [2018-06-26 22:05:01,225 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:01,225 INFO ]: Abstraction has 40 states and 113 transitions. [2018-06-26 22:05:01,225 INFO ]: Interpolant automaton has 5 states. [2018-06-26 22:05:01,225 INFO ]: Start isEmpty. Operand 40 states and 113 transitions. [2018-06-26 22:05:01,225 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 22:05:01,225 INFO ]: Found error trace [2018-06-26 22:05:01,226 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:01,226 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:01,226 INFO ]: Analyzing trace with hash 1954130991, now seen corresponding path program 4 times [2018-06-26 22:05:01,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:01,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:01,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:01,226 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:01,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:01,258 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:01,361 INFO ]: Checked inductivity of 435 backedges. 221 proven. 135 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 22:05:01,361 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:01,361 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:01,376 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:05:01,459 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:05:01,459 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:01,465 INFO ]: Computing forward predicates... [2018-06-26 22:05:01,503 INFO ]: Checked inductivity of 435 backedges. 221 proven. 135 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 22:05:01,534 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:01,534 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 22:05:01,535 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:05:01,535 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:05:01,535 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:05:01,535 INFO ]: Start difference. First operand 40 states and 113 transitions. Second operand 6 states. [2018-06-26 22:05:01,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:01,836 INFO ]: Finished difference Result 69 states and 188 transitions. [2018-06-26 22:05:01,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 22:05:01,836 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 22:05:01,836 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:01,837 INFO ]: With dead ends: 69 [2018-06-26 22:05:01,837 INFO ]: Without dead ends: 48 [2018-06-26 22:05:01,837 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:05:01,837 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 22:05:01,840 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-06-26 22:05:01,840 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 22:05:01,841 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 125 transitions. [2018-06-26 22:05:01,841 INFO ]: Start accepts. Automaton has 44 states and 125 transitions. Word has length 34 [2018-06-26 22:05:01,841 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:01,841 INFO ]: Abstraction has 44 states and 125 transitions. [2018-06-26 22:05:01,841 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:05:01,841 INFO ]: Start isEmpty. Operand 44 states and 125 transitions. [2018-06-26 22:05:01,842 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 22:05:01,842 INFO ]: Found error trace [2018-06-26 22:05:01,842 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:01,842 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:01,844 INFO ]: Analyzing trace with hash 210750823, now seen corresponding path program 5 times [2018-06-26 22:05:01,844 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:01,844 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:01,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:01,845 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:01,845 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:01,868 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:01,997 INFO ]: Checked inductivity of 561 backedges. 330 proven. 135 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-26 22:05:01,997 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:01,997 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 22:05:02,004 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:05:02,197 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-06-26 22:05:02,197 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:02,201 INFO ]: Computing forward predicates... [2018-06-26 22:05:02,244 INFO ]: Checked inductivity of 561 backedges. 330 proven. 135 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-26 22:05:02,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:02,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 22:05:02,277 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:05:02,277 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:05:02,277 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:05:02,277 INFO ]: Start difference. First operand 44 states and 125 transitions. Second operand 6 states. [2018-06-26 22:05:02,433 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:02,433 INFO ]: Finished difference Result 55 states and 158 transitions. [2018-06-26 22:05:02,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 22:05:02,434 INFO ]: Start accepts. Automaton has 6 states. Word has length 38 [2018-06-26 22:05:02,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:02,434 INFO ]: With dead ends: 55 [2018-06-26 22:05:02,434 INFO ]: Without dead ends: 54 [2018-06-26 22:05:02,434 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:05:02,434 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 22:05:02,437 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-06-26 22:05:02,438 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 22:05:02,438 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 136 transitions. [2018-06-26 22:05:02,438 INFO ]: Start accepts. Automaton has 48 states and 136 transitions. Word has length 38 [2018-06-26 22:05:02,438 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:02,438 INFO ]: Abstraction has 48 states and 136 transitions. [2018-06-26 22:05:02,438 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:05:02,438 INFO ]: Start isEmpty. Operand 48 states and 136 transitions. [2018-06-26 22:05:02,439 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 22:05:02,439 INFO ]: Found error trace [2018-06-26 22:05:02,439 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:02,439 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:02,440 INFO ]: Analyzing trace with hash 405935612, now seen corresponding path program 6 times [2018-06-26 22:05:02,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:02,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:02,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:02,441 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:02,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:02,465 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:02,663 INFO ]: Checked inductivity of 703 backedges. 353 proven. 243 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-06-26 22:05:02,663 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:02,663 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:02,669 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:05:02,893 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-26 22:05:02,893 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:02,899 INFO ]: Computing forward predicates... [2018-06-26 22:05:02,938 INFO ]: Checked inductivity of 703 backedges. 350 proven. 243 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 22:05:02,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:02,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:05:02,961 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:05:02,961 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:05:02,961 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:05:02,961 INFO ]: Start difference. First operand 48 states and 136 transitions. Second operand 7 states. [2018-06-26 22:05:03,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:03,219 INFO ]: Finished difference Result 81 states and 222 transitions. [2018-06-26 22:05:03,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:05:03,219 INFO ]: Start accepts. Automaton has 7 states. Word has length 42 [2018-06-26 22:05:03,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:03,220 INFO ]: With dead ends: 81 [2018-06-26 22:05:03,220 INFO ]: Without dead ends: 56 [2018-06-26 22:05:03,220 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:05:03,220 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-26 22:05:03,222 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-06-26 22:05:03,222 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-26 22:05:03,223 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 148 transitions. [2018-06-26 22:05:03,223 INFO ]: Start accepts. Automaton has 52 states and 148 transitions. Word has length 42 [2018-06-26 22:05:03,223 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:03,223 INFO ]: Abstraction has 52 states and 148 transitions. [2018-06-26 22:05:03,223 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:05:03,223 INFO ]: Start isEmpty. Operand 52 states and 148 transitions. [2018-06-26 22:05:03,224 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 22:05:03,224 INFO ]: Found error trace [2018-06-26 22:05:03,224 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:03,224 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:03,224 INFO ]: Analyzing trace with hash 2073001780, now seen corresponding path program 7 times [2018-06-26 22:05:03,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:03,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:03,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:03,225 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:03,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:03,247 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:03,575 INFO ]: Checked inductivity of 861 backedges. 494 proven. 243 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 22:05:03,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:03,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:03,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:03,706 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:03,711 INFO ]: Computing forward predicates... [2018-06-26 22:05:03,737 INFO ]: Checked inductivity of 861 backedges. 494 proven. 243 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 22:05:03,766 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:03,766 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 22:05:03,766 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:05:03,766 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:05:03,766 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:05:03,766 INFO ]: Start difference. First operand 52 states and 148 transitions. Second operand 7 states. [2018-06-26 22:05:05,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:05,221 INFO ]: Finished difference Result 63 states and 181 transitions. [2018-06-26 22:05:05,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 22:05:05,225 INFO ]: Start accepts. Automaton has 7 states. Word has length 46 [2018-06-26 22:05:05,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:05,226 INFO ]: With dead ends: 63 [2018-06-26 22:05:05,226 INFO ]: Without dead ends: 62 [2018-06-26 22:05:05,226 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:05:05,226 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-26 22:05:05,229 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-06-26 22:05:05,229 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 22:05:05,229 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 159 transitions. [2018-06-26 22:05:05,230 INFO ]: Start accepts. Automaton has 56 states and 159 transitions. Word has length 46 [2018-06-26 22:05:05,230 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:05,230 INFO ]: Abstraction has 56 states and 159 transitions. [2018-06-26 22:05:05,230 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:05:05,230 INFO ]: Start isEmpty. Operand 56 states and 159 transitions. [2018-06-26 22:05:05,231 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 22:05:05,231 INFO ]: Found error trace [2018-06-26 22:05:05,231 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:05,231 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:05,231 INFO ]: Analyzing trace with hash -1187374775, now seen corresponding path program 8 times [2018-06-26 22:05:05,231 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:05,231 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:05,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:05,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:05,232 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:05,262 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:05,497 INFO ]: Checked inductivity of 1035 backedges. 517 proven. 383 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-06-26 22:05:05,497 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:05,497 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:05,504 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:05:05,612 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:05:05,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:05,617 INFO ]: Computing forward predicates... [2018-06-26 22:05:05,646 INFO ]: Checked inductivity of 1035 backedges. 517 proven. 383 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-06-26 22:05:05,670 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:05,670 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 22:05:05,670 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:05:05,670 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:05:05,670 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:05:05,671 INFO ]: Start difference. First operand 56 states and 159 transitions. Second operand 8 states. [2018-06-26 22:05:06,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:06,055 INFO ]: Finished difference Result 93 states and 256 transitions. [2018-06-26 22:05:06,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:05:06,056 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-26 22:05:06,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:06,057 INFO ]: With dead ends: 93 [2018-06-26 22:05:06,057 INFO ]: Without dead ends: 64 [2018-06-26 22:05:06,057 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:05:06,057 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 22:05:06,059 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-06-26 22:05:06,059 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-26 22:05:06,060 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 171 transitions. [2018-06-26 22:05:06,060 INFO ]: Start accepts. Automaton has 60 states and 171 transitions. Word has length 50 [2018-06-26 22:05:06,060 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:06,060 INFO ]: Abstraction has 60 states and 171 transitions. [2018-06-26 22:05:06,060 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:05:06,060 INFO ]: Start isEmpty. Operand 60 states and 171 transitions. [2018-06-26 22:05:06,061 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 22:05:06,061 INFO ]: Found error trace [2018-06-26 22:05:06,061 INFO ]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:06,062 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:06,062 INFO ]: Analyzing trace with hash -266941823, now seen corresponding path program 9 times [2018-06-26 22:05:06,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:06,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:06,062 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:06,088 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:06,573 INFO ]: Checked inductivity of 1225 backedges. 690 proven. 383 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-26 22:05:06,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:06,573 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:06,580 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:05:06,722 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-06-26 22:05:06,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:06,728 INFO ]: Computing forward predicates... [2018-06-26 22:05:06,758 INFO ]: Checked inductivity of 1225 backedges. 690 proven. 383 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-26 22:05:06,792 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:06,792 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 22:05:06,792 INFO ]: Interpolant automaton has 8 states [2018-06-26 22:05:06,793 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 22:05:06,793 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:05:06,793 INFO ]: Start difference. First operand 60 states and 171 transitions. Second operand 8 states. [2018-06-26 22:05:07,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:07,077 INFO ]: Finished difference Result 71 states and 204 transitions. [2018-06-26 22:05:07,077 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:05:07,077 INFO ]: Start accepts. Automaton has 8 states. Word has length 54 [2018-06-26 22:05:07,077 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:07,077 INFO ]: With dead ends: 71 [2018-06-26 22:05:07,077 INFO ]: Without dead ends: 70 [2018-06-26 22:05:07,077 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:05:07,078 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 22:05:07,079 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-06-26 22:05:07,079 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-26 22:05:07,080 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 182 transitions. [2018-06-26 22:05:07,080 INFO ]: Start accepts. Automaton has 64 states and 182 transitions. Word has length 54 [2018-06-26 22:05:07,081 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:07,081 INFO ]: Abstraction has 64 states and 182 transitions. [2018-06-26 22:05:07,081 INFO ]: Interpolant automaton has 8 states. [2018-06-26 22:05:07,081 INFO ]: Start isEmpty. Operand 64 states and 182 transitions. [2018-06-26 22:05:07,081 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-26 22:05:07,081 INFO ]: Found error trace [2018-06-26 22:05:07,081 INFO ]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:07,081 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:07,082 INFO ]: Analyzing trace with hash -1218382314, now seen corresponding path program 10 times [2018-06-26 22:05:07,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:07,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:07,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:07,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:07,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:07,109 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:07,269 INFO ]: Checked inductivity of 1431 backedges. 713 proven. 555 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 22:05:07,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:07,288 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:07,294 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:05:07,399 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:05:07,399 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:07,405 INFO ]: Computing forward predicates... [2018-06-26 22:05:07,443 INFO ]: Checked inductivity of 1431 backedges. 713 proven. 555 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-06-26 22:05:07,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:07,476 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 22:05:07,476 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:05:07,476 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:05:07,476 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:05:07,476 INFO ]: Start difference. First operand 64 states and 182 transitions. Second operand 9 states. [2018-06-26 22:05:07,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:07,750 INFO ]: Finished difference Result 105 states and 290 transitions. [2018-06-26 22:05:07,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:05:07,752 INFO ]: Start accepts. Automaton has 9 states. Word has length 58 [2018-06-26 22:05:07,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:07,753 INFO ]: With dead ends: 105 [2018-06-26 22:05:07,753 INFO ]: Without dead ends: 72 [2018-06-26 22:05:07,753 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:05:07,753 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 22:05:07,755 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-06-26 22:05:07,755 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-26 22:05:07,756 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 194 transitions. [2018-06-26 22:05:07,756 INFO ]: Start accepts. Automaton has 68 states and 194 transitions. Word has length 58 [2018-06-26 22:05:07,756 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:07,756 INFO ]: Abstraction has 68 states and 194 transitions. [2018-06-26 22:05:07,756 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:05:07,756 INFO ]: Start isEmpty. Operand 68 states and 194 transitions. [2018-06-26 22:05:07,759 INFO ]: Finished isEmpty. Found accepting run of length 63 [2018-06-26 22:05:07,759 INFO ]: Found error trace [2018-06-26 22:05:07,759 INFO ]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:07,759 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:07,759 INFO ]: Analyzing trace with hash 301264718, now seen corresponding path program 11 times [2018-06-26 22:05:07,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:07,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:07,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:07,760 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:07,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:07,785 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:07,964 INFO ]: Checked inductivity of 1653 backedges. 918 proven. 555 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-06-26 22:05:07,964 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:07,964 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:07,970 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:05:08,149 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-06-26 22:05:08,149 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:08,156 INFO ]: Computing forward predicates... [2018-06-26 22:05:08,185 INFO ]: Checked inductivity of 1653 backedges. 918 proven. 555 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-06-26 22:05:08,213 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:08,213 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 22:05:08,213 INFO ]: Interpolant automaton has 9 states [2018-06-26 22:05:08,213 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 22:05:08,213 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:05:08,213 INFO ]: Start difference. First operand 68 states and 194 transitions. Second operand 9 states. [2018-06-26 22:05:08,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:08,556 INFO ]: Finished difference Result 79 states and 227 transitions. [2018-06-26 22:05:08,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:05:08,557 INFO ]: Start accepts. Automaton has 9 states. Word has length 62 [2018-06-26 22:05:08,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:08,557 INFO ]: With dead ends: 79 [2018-06-26 22:05:08,557 INFO ]: Without dead ends: 78 [2018-06-26 22:05:08,557 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:05:08,557 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-26 22:05:08,560 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 72. [2018-06-26 22:05:08,560 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 22:05:08,560 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 205 transitions. [2018-06-26 22:05:08,560 INFO ]: Start accepts. Automaton has 72 states and 205 transitions. Word has length 62 [2018-06-26 22:05:08,561 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:08,561 INFO ]: Abstraction has 72 states and 205 transitions. [2018-06-26 22:05:08,561 INFO ]: Interpolant automaton has 9 states. [2018-06-26 22:05:08,561 INFO ]: Start isEmpty. Operand 72 states and 205 transitions. [2018-06-26 22:05:08,561 INFO ]: Finished isEmpty. Found accepting run of length 67 [2018-06-26 22:05:08,561 INFO ]: Found error trace [2018-06-26 22:05:08,561 INFO ]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:08,562 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:08,562 INFO ]: Analyzing trace with hash -1059722141, now seen corresponding path program 12 times [2018-06-26 22:05:08,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:08,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:08,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:08,562 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:08,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:08,619 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:09,730 INFO ]: Checked inductivity of 1891 backedges. 941 proven. 759 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-26 22:05:09,730 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:09,730 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:09,747 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:05:10,245 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-06-26 22:05:10,245 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:10,253 INFO ]: Computing forward predicates... [2018-06-26 22:05:10,285 INFO ]: Checked inductivity of 1891 backedges. 938 proven. 759 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-06-26 22:05:10,316 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:10,316 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 22:05:10,316 INFO ]: Interpolant automaton has 10 states [2018-06-26 22:05:10,316 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 22:05:10,316 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:05:10,316 INFO ]: Start difference. First operand 72 states and 205 transitions. Second operand 10 states. [2018-06-26 22:05:10,723 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:10,723 INFO ]: Finished difference Result 117 states and 324 transitions. [2018-06-26 22:05:10,723 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 22:05:10,723 INFO ]: Start accepts. Automaton has 10 states. Word has length 66 [2018-06-26 22:05:10,723 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:10,724 INFO ]: With dead ends: 117 [2018-06-26 22:05:10,724 INFO ]: Without dead ends: 80 [2018-06-26 22:05:10,724 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:05:10,724 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-26 22:05:10,726 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-06-26 22:05:10,726 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-26 22:05:10,727 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 217 transitions. [2018-06-26 22:05:10,727 INFO ]: Start accepts. Automaton has 76 states and 217 transitions. Word has length 66 [2018-06-26 22:05:10,727 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:10,727 INFO ]: Abstraction has 76 states and 217 transitions. [2018-06-26 22:05:10,727 INFO ]: Interpolant automaton has 10 states. [2018-06-26 22:05:10,727 INFO ]: Start isEmpty. Operand 76 states and 217 transitions. [2018-06-26 22:05:10,728 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-26 22:05:10,728 INFO ]: Found error trace [2018-06-26 22:05:10,728 INFO ]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:10,728 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:10,728 INFO ]: Analyzing trace with hash -682021477, now seen corresponding path program 13 times [2018-06-26 22:05:10,728 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:10,728 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:10,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:10,729 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:10,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:10,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:11,062 INFO ]: Checked inductivity of 2145 backedges. 1178 proven. 759 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-06-26 22:05:11,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:11,062 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:11,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:11,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:11,222 INFO ]: Computing forward predicates... [2018-06-26 22:05:11,254 INFO ]: Checked inductivity of 2145 backedges. 1178 proven. 759 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-06-26 22:05:11,286 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:11,286 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 22:05:11,286 INFO ]: Interpolant automaton has 10 states [2018-06-26 22:05:11,287 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 22:05:11,287 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:05:11,287 INFO ]: Start difference. First operand 76 states and 217 transitions. Second operand 10 states. [2018-06-26 22:05:11,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:11,599 INFO ]: Finished difference Result 87 states and 250 transitions. [2018-06-26 22:05:11,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 22:05:11,599 INFO ]: Start accepts. Automaton has 10 states. Word has length 70 [2018-06-26 22:05:11,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:11,600 INFO ]: With dead ends: 87 [2018-06-26 22:05:11,600 INFO ]: Without dead ends: 86 [2018-06-26 22:05:11,600 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 22:05:11,600 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-26 22:05:11,602 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 80. [2018-06-26 22:05:11,602 INFO ]: Start removeUnreachable. Operand 80 states. [2018-06-26 22:05:11,603 INFO ]: Finished removeUnreachable. Reduced from 80 states to 80 states and 228 transitions. [2018-06-26 22:05:11,603 INFO ]: Start accepts. Automaton has 80 states and 228 transitions. Word has length 70 [2018-06-26 22:05:11,603 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:11,603 INFO ]: Abstraction has 80 states and 228 transitions. [2018-06-26 22:05:11,603 INFO ]: Interpolant automaton has 10 states. [2018-06-26 22:05:11,603 INFO ]: Start isEmpty. Operand 80 states and 228 transitions. [2018-06-26 22:05:11,604 INFO ]: Finished isEmpty. Found accepting run of length 75 [2018-06-26 22:05:11,604 INFO ]: Found error trace [2018-06-26 22:05:11,604 INFO ]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:11,604 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:11,604 INFO ]: Analyzing trace with hash -1574421456, now seen corresponding path program 14 times [2018-06-26 22:05:11,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:11,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:11,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:11,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:11,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:11,637 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:11,799 INFO ]: Checked inductivity of 2415 backedges. 1201 proven. 995 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-06-26 22:05:11,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:11,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:11,805 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:05:11,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:05:11,954 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:11,961 INFO ]: Computing forward predicates... [2018-06-26 22:05:11,996 INFO ]: Checked inductivity of 2415 backedges. 1201 proven. 995 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-06-26 22:05:12,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:12,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 22:05:12,020 INFO ]: Interpolant automaton has 11 states [2018-06-26 22:05:12,020 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 22:05:12,020 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:05:12,020 INFO ]: Start difference. First operand 80 states and 228 transitions. Second operand 11 states. [2018-06-26 22:05:12,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:12,427 INFO ]: Finished difference Result 129 states and 358 transitions. [2018-06-26 22:05:12,444 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 22:05:12,444 INFO ]: Start accepts. Automaton has 11 states. Word has length 74 [2018-06-26 22:05:12,444 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:12,445 INFO ]: With dead ends: 129 [2018-06-26 22:05:12,445 INFO ]: Without dead ends: 88 [2018-06-26 22:05:12,445 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:05:12,445 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-26 22:05:12,447 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-06-26 22:05:12,447 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-26 22:05:12,447 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 240 transitions. [2018-06-26 22:05:12,447 INFO ]: Start accepts. Automaton has 84 states and 240 transitions. Word has length 74 [2018-06-26 22:05:12,448 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:12,448 INFO ]: Abstraction has 84 states and 240 transitions. [2018-06-26 22:05:12,448 INFO ]: Interpolant automaton has 11 states. [2018-06-26 22:05:12,448 INFO ]: Start isEmpty. Operand 84 states and 240 transitions. [2018-06-26 22:05:12,448 INFO ]: Finished isEmpty. Found accepting run of length 79 [2018-06-26 22:05:12,448 INFO ]: Found error trace [2018-06-26 22:05:12,448 INFO ]: trace histogram [9, 9, 9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:12,448 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:12,448 INFO ]: Analyzing trace with hash 1423099240, now seen corresponding path program 15 times [2018-06-26 22:05:12,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:12,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:12,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:12,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:12,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:12,478 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:12,815 INFO ]: Checked inductivity of 2701 backedges. 1470 proven. 995 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-26 22:05:12,815 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:12,815 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:12,820 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:05:13,055 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-06-26 22:05:13,055 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:13,065 INFO ]: Computing forward predicates... [2018-06-26 22:05:13,103 INFO ]: Checked inductivity of 2701 backedges. 1470 proven. 995 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-06-26 22:05:13,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:13,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 22:05:13,136 INFO ]: Interpolant automaton has 11 states [2018-06-26 22:05:13,136 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 22:05:13,136 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:05:13,136 INFO ]: Start difference. First operand 84 states and 240 transitions. Second operand 11 states. [2018-06-26 22:05:15,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:15,139 INFO ]: Finished difference Result 95 states and 273 transitions. [2018-06-26 22:05:15,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 22:05:15,140 INFO ]: Start accepts. Automaton has 11 states. Word has length 78 [2018-06-26 22:05:15,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:15,141 INFO ]: With dead ends: 95 [2018-06-26 22:05:15,141 INFO ]: Without dead ends: 94 [2018-06-26 22:05:15,141 INFO ]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:05:15,141 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-26 22:05:15,144 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-06-26 22:05:15,144 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-26 22:05:15,145 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 251 transitions. [2018-06-26 22:05:15,145 INFO ]: Start accepts. Automaton has 88 states and 251 transitions. Word has length 78 [2018-06-26 22:05:15,145 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:15,145 INFO ]: Abstraction has 88 states and 251 transitions. [2018-06-26 22:05:15,145 INFO ]: Interpolant automaton has 11 states. [2018-06-26 22:05:15,145 INFO ]: Start isEmpty. Operand 88 states and 251 transitions. [2018-06-26 22:05:15,146 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-26 22:05:15,146 INFO ]: Found error trace [2018-06-26 22:05:15,146 INFO ]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:15,146 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:15,146 INFO ]: Analyzing trace with hash 373761405, now seen corresponding path program 16 times [2018-06-26 22:05:15,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:15,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:15,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:15,147 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:15,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:15,189 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:15,558 INFO ]: Checked inductivity of 3003 backedges. 1493 proven. 1263 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-06-26 22:05:15,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:15,558 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:15,564 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:05:15,739 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:05:15,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:15,746 INFO ]: Computing forward predicates... [2018-06-26 22:05:15,782 INFO ]: Checked inductivity of 3003 backedges. 1493 proven. 1263 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-06-26 22:05:15,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:15,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 22:05:15,815 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:05:15,815 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:05:15,815 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:05:15,815 INFO ]: Start difference. First operand 88 states and 251 transitions. Second operand 12 states. [2018-06-26 22:05:16,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:16,884 INFO ]: Finished difference Result 141 states and 392 transitions. [2018-06-26 22:05:16,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:05:16,885 INFO ]: Start accepts. Automaton has 12 states. Word has length 82 [2018-06-26 22:05:16,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:16,885 INFO ]: With dead ends: 141 [2018-06-26 22:05:16,885 INFO ]: Without dead ends: 96 [2018-06-26 22:05:16,886 INFO ]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:05:16,886 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-26 22:05:16,888 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-06-26 22:05:16,888 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-26 22:05:16,889 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 263 transitions. [2018-06-26 22:05:16,889 INFO ]: Start accepts. Automaton has 92 states and 263 transitions. Word has length 82 [2018-06-26 22:05:16,889 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:16,889 INFO ]: Abstraction has 92 states and 263 transitions. [2018-06-26 22:05:16,889 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:05:16,889 INFO ]: Start isEmpty. Operand 92 states and 263 transitions. [2018-06-26 22:05:16,890 INFO ]: Finished isEmpty. Found accepting run of length 87 [2018-06-26 22:05:16,890 INFO ]: Found error trace [2018-06-26 22:05:16,890 INFO ]: trace histogram [10, 10, 10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:16,890 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:16,890 INFO ]: Analyzing trace with hash -1924073803, now seen corresponding path program 17 times [2018-06-26 22:05:16,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:16,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:16,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:16,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:16,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:16,924 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:17,619 INFO ]: Checked inductivity of 3321 backedges. 1794 proven. 1263 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-06-26 22:05:17,619 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:17,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:17,648 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 22:05:17,929 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-06-26 22:05:17,929 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:17,937 INFO ]: Computing forward predicates... [2018-06-26 22:05:17,973 INFO ]: Checked inductivity of 3321 backedges. 1794 proven. 1263 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-06-26 22:05:18,007 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:18,007 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 22:05:18,007 INFO ]: Interpolant automaton has 12 states [2018-06-26 22:05:18,007 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 22:05:18,007 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:05:18,007 INFO ]: Start difference. First operand 92 states and 263 transitions. Second operand 12 states. [2018-06-26 22:05:18,610 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:18,610 INFO ]: Finished difference Result 103 states and 296 transitions. [2018-06-26 22:05:18,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 22:05:18,610 INFO ]: Start accepts. Automaton has 12 states. Word has length 86 [2018-06-26 22:05:18,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:18,611 INFO ]: With dead ends: 103 [2018-06-26 22:05:18,611 INFO ]: Without dead ends: 102 [2018-06-26 22:05:18,611 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:05:18,611 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-26 22:05:18,616 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-06-26 22:05:18,616 INFO ]: Start removeUnreachable. Operand 96 states. [2018-06-26 22:05:18,616 INFO ]: Finished removeUnreachable. Reduced from 96 states to 96 states and 274 transitions. [2018-06-26 22:05:18,617 INFO ]: Start accepts. Automaton has 96 states and 274 transitions. Word has length 86 [2018-06-26 22:05:18,617 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:18,617 INFO ]: Abstraction has 96 states and 274 transitions. [2018-06-26 22:05:18,617 INFO ]: Interpolant automaton has 12 states. [2018-06-26 22:05:18,617 INFO ]: Start isEmpty. Operand 96 states and 274 transitions. [2018-06-26 22:05:18,618 INFO ]: Finished isEmpty. Found accepting run of length 91 [2018-06-26 22:05:18,618 INFO ]: Found error trace [2018-06-26 22:05:18,618 INFO ]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:18,618 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:18,618 INFO ]: Analyzing trace with hash -1769871286, now seen corresponding path program 18 times [2018-06-26 22:05:18,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:18,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:18,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:18,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:18,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:18,656 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:20,135 INFO ]: Checked inductivity of 3655 backedges. 1817 proven. 1563 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-06-26 22:05:20,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:20,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:20,142 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 22:05:20,405 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-06-26 22:05:20,405 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:20,413 INFO ]: Computing forward predicates... [2018-06-26 22:05:20,451 INFO ]: Checked inductivity of 3655 backedges. 1814 proven. 1563 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-06-26 22:05:20,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:20,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 22:05:20,485 INFO ]: Interpolant automaton has 13 states [2018-06-26 22:05:20,485 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 22:05:20,485 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:05:20,485 INFO ]: Start difference. First operand 96 states and 274 transitions. Second operand 13 states. [2018-06-26 22:05:20,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:20,978 INFO ]: Finished difference Result 153 states and 426 transitions. [2018-06-26 22:05:20,979 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 22:05:20,979 INFO ]: Start accepts. Automaton has 13 states. Word has length 90 [2018-06-26 22:05:20,979 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:20,980 INFO ]: With dead ends: 153 [2018-06-26 22:05:20,980 INFO ]: Without dead ends: 104 [2018-06-26 22:05:20,980 INFO ]: 0 DeclaredPredicates, 173 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:05:20,980 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-26 22:05:20,983 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-06-26 22:05:20,983 INFO ]: Start removeUnreachable. Operand 100 states. [2018-06-26 22:05:20,984 INFO ]: Finished removeUnreachable. Reduced from 100 states to 100 states and 286 transitions. [2018-06-26 22:05:20,984 INFO ]: Start accepts. Automaton has 100 states and 286 transitions. Word has length 90 [2018-06-26 22:05:20,984 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:20,984 INFO ]: Abstraction has 100 states and 286 transitions. [2018-06-26 22:05:20,984 INFO ]: Interpolant automaton has 13 states. [2018-06-26 22:05:20,984 INFO ]: Start isEmpty. Operand 100 states and 286 transitions. [2018-06-26 22:05:20,985 INFO ]: Finished isEmpty. Found accepting run of length 95 [2018-06-26 22:05:20,985 INFO ]: Found error trace [2018-06-26 22:05:20,985 INFO ]: trace histogram [11, 11, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:20,985 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:20,985 INFO ]: Analyzing trace with hash 1109590402, now seen corresponding path program 19 times [2018-06-26 22:05:20,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:20,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:20,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:20,986 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:20,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:21,026 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:21,350 INFO ]: Checked inductivity of 4005 backedges. 2150 proven. 1563 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-26 22:05:21,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:21,350 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) [2018-06-26 22:05:21,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:21,585 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:21,599 INFO ]: Computing forward predicates... [2018-06-26 22:05:21,647 INFO ]: Checked inductivity of 4005 backedges. 2150 proven. 1563 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-06-26 22:05:21,680 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:21,680 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 22:05:21,680 INFO ]: Interpolant automaton has 13 states [2018-06-26 22:05:21,680 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 22:05:21,680 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:05:21,680 INFO ]: Start difference. First operand 100 states and 286 transitions. Second operand 13 states. [2018-06-26 22:05:22,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:22,390 INFO ]: Finished difference Result 111 states and 319 transitions. [2018-06-26 22:05:22,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 22:05:22,390 INFO ]: Start accepts. Automaton has 13 states. Word has length 94 [2018-06-26 22:05:22,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:22,391 INFO ]: With dead ends: 111 [2018-06-26 22:05:22,391 INFO ]: Without dead ends: 110 [2018-06-26 22:05:22,391 INFO ]: 0 DeclaredPredicates, 178 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 22:05:22,391 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-26 22:05:22,394 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-06-26 22:05:22,394 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-26 22:05:22,394 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 297 transitions. [2018-06-26 22:05:22,394 INFO ]: Start accepts. Automaton has 104 states and 297 transitions. Word has length 94 [2018-06-26 22:05:22,395 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:22,395 INFO ]: Abstraction has 104 states and 297 transitions. [2018-06-26 22:05:22,395 INFO ]: Interpolant automaton has 13 states. [2018-06-26 22:05:22,395 INFO ]: Start isEmpty. Operand 104 states and 297 transitions. [2018-06-26 22:05:22,396 INFO ]: Finished isEmpty. Found accepting run of length 99 [2018-06-26 22:05:22,396 INFO ]: Found error trace [2018-06-26 22:05:22,396 INFO ]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:22,396 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:22,396 INFO ]: Analyzing trace with hash 713540759, now seen corresponding path program 20 times [2018-06-26 22:05:22,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:22,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:22,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:22,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:22,398 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:22,438 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:22,716 INFO ]: Checked inductivity of 4371 backedges. 2173 proven. 1895 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-06-26 22:05:22,716 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:22,716 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:22,722 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:05:22,909 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:05:22,909 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:22,919 INFO ]: Computing forward predicates... [2018-06-26 22:05:22,959 INFO ]: Checked inductivity of 4371 backedges. 2173 proven. 1895 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-06-26 22:05:22,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:22,988 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 22:05:22,988 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:05:22,988 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:05:22,988 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:05:22,988 INFO ]: Start difference. First operand 104 states and 297 transitions. Second operand 14 states. [2018-06-26 22:05:23,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:23,540 INFO ]: Finished difference Result 165 states and 460 transitions. [2018-06-26 22:05:23,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 22:05:23,542 INFO ]: Start accepts. Automaton has 14 states. Word has length 98 [2018-06-26 22:05:23,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:23,542 INFO ]: With dead ends: 165 [2018-06-26 22:05:23,542 INFO ]: Without dead ends: 112 [2018-06-26 22:05:23,542 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:05:23,543 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-26 22:05:23,545 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-06-26 22:05:23,545 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-26 22:05:23,546 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 309 transitions. [2018-06-26 22:05:23,546 INFO ]: Start accepts. Automaton has 108 states and 309 transitions. Word has length 98 [2018-06-26 22:05:23,546 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:23,546 INFO ]: Abstraction has 108 states and 309 transitions. [2018-06-26 22:05:23,546 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:05:23,546 INFO ]: Start isEmpty. Operand 108 states and 309 transitions. [2018-06-26 22:05:23,547 INFO ]: Finished isEmpty. Found accepting run of length 103 [2018-06-26 22:05:23,547 INFO ]: Found error trace [2018-06-26 22:05:23,547 INFO ]: trace histogram [12, 12, 12, 12, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:23,547 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:23,547 INFO ]: Analyzing trace with hash -1023924785, now seen corresponding path program 21 times [2018-06-26 22:05:23,547 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:23,547 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:23,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:23,550 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:23,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:23,597 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:24,310 INFO ]: Checked inductivity of 4753 backedges. 2538 proven. 1895 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-06-26 22:05:24,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:24,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:24,323 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:05:24,661 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-06-26 22:05:24,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:24,669 INFO ]: Computing forward predicates... [2018-06-26 22:05:24,707 INFO ]: Checked inductivity of 4753 backedges. 2538 proven. 1895 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-06-26 22:05:24,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:24,741 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-26 22:05:24,741 INFO ]: Interpolant automaton has 14 states [2018-06-26 22:05:24,741 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 22:05:24,741 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:05:24,742 INFO ]: Start difference. First operand 108 states and 309 transitions. Second operand 14 states. [2018-06-26 22:05:25,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:25,572 INFO ]: Finished difference Result 119 states and 342 transitions. [2018-06-26 22:05:25,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 22:05:25,572 INFO ]: Start accepts. Automaton has 14 states. Word has length 102 [2018-06-26 22:05:25,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:25,573 INFO ]: With dead ends: 119 [2018-06-26 22:05:25,573 INFO ]: Without dead ends: 118 [2018-06-26 22:05:25,573 INFO ]: 0 DeclaredPredicates, 194 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 22:05:25,573 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-26 22:05:25,576 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-06-26 22:05:25,576 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-26 22:05:25,577 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 320 transitions. [2018-06-26 22:05:25,577 INFO ]: Start accepts. Automaton has 112 states and 320 transitions. Word has length 102 [2018-06-26 22:05:25,577 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:25,577 INFO ]: Abstraction has 112 states and 320 transitions. [2018-06-26 22:05:25,577 INFO ]: Interpolant automaton has 14 states. [2018-06-26 22:05:25,577 INFO ]: Start isEmpty. Operand 112 states and 320 transitions. [2018-06-26 22:05:25,578 INFO ]: Finished isEmpty. Found accepting run of length 107 [2018-06-26 22:05:25,578 INFO ]: Found error trace [2018-06-26 22:05:25,578 INFO ]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:25,578 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:25,578 INFO ]: Analyzing trace with hash 946338404, now seen corresponding path program 22 times [2018-06-26 22:05:25,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:25,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:25,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:25,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:25,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:25,626 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:25,880 INFO ]: Checked inductivity of 5151 backedges. 2561 proven. 2259 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-06-26 22:05:25,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:25,880 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 22:05:25,885 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:05:26,080 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:05:26,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:26,091 INFO ]: Computing forward predicates... [2018-06-26 22:05:26,136 INFO ]: Checked inductivity of 5151 backedges. 2561 proven. 2259 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2018-06-26 22:05:26,169 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:26,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 22:05:26,169 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:05:26,169 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:05:26,170 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:05:26,170 INFO ]: Start difference. First operand 112 states and 320 transitions. Second operand 15 states. [2018-06-26 22:05:26,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:26,821 INFO ]: Finished difference Result 177 states and 494 transitions. [2018-06-26 22:05:26,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 22:05:26,821 INFO ]: Start accepts. Automaton has 15 states. Word has length 106 [2018-06-26 22:05:26,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:26,821 INFO ]: With dead ends: 177 [2018-06-26 22:05:26,822 INFO ]: Without dead ends: 120 [2018-06-26 22:05:26,822 INFO ]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:05:26,822 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-26 22:05:26,823 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 116. [2018-06-26 22:05:26,823 INFO ]: Start removeUnreachable. Operand 116 states. [2018-06-26 22:05:26,824 INFO ]: Finished removeUnreachable. Reduced from 116 states to 116 states and 332 transitions. [2018-06-26 22:05:26,824 INFO ]: Start accepts. Automaton has 116 states and 332 transitions. Word has length 106 [2018-06-26 22:05:26,824 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:26,824 INFO ]: Abstraction has 116 states and 332 transitions. [2018-06-26 22:05:26,824 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:05:26,824 INFO ]: Start isEmpty. Operand 116 states and 332 transitions. [2018-06-26 22:05:26,824 INFO ]: Finished isEmpty. Found accepting run of length 111 [2018-06-26 22:05:26,824 INFO ]: Found error trace [2018-06-26 22:05:26,824 INFO ]: trace histogram [13, 13, 13, 13, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:26,825 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:26,825 INFO ]: Analyzing trace with hash -1109417060, now seen corresponding path program 23 times [2018-06-26 22:05:26,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:26,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:26,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:26,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:26,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:26,870 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:27,248 INFO ]: Checked inductivity of 5565 backedges. 2958 proven. 2259 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-06-26 22:05:27,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:27,248 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 22:05:27,261 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:27,696 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2018-06-26 22:05:27,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:27,709 INFO ]: Computing forward predicates... [2018-06-26 22:05:27,751 INFO ]: Checked inductivity of 5565 backedges. 2958 proven. 2259 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-06-26 22:05:27,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:27,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 22:05:27,785 INFO ]: Interpolant automaton has 15 states [2018-06-26 22:05:27,785 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 22:05:27,786 INFO ]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:05:27,786 INFO ]: Start difference. First operand 116 states and 332 transitions. Second operand 15 states. [2018-06-26 22:05:28,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:28,372 INFO ]: Finished difference Result 127 states and 365 transitions. [2018-06-26 22:05:28,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 22:05:28,373 INFO ]: Start accepts. Automaton has 15 states. Word has length 110 [2018-06-26 22:05:28,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:28,373 INFO ]: With dead ends: 127 [2018-06-26 22:05:28,373 INFO ]: Without dead ends: 126 [2018-06-26 22:05:28,373 INFO ]: 0 DeclaredPredicates, 210 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-06-26 22:05:28,373 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-26 22:05:28,376 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-06-26 22:05:28,376 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-26 22:05:28,376 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 343 transitions. [2018-06-26 22:05:28,376 INFO ]: Start accepts. Automaton has 120 states and 343 transitions. Word has length 110 [2018-06-26 22:05:28,377 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:28,377 INFO ]: Abstraction has 120 states and 343 transitions. [2018-06-26 22:05:28,377 INFO ]: Interpolant automaton has 15 states. [2018-06-26 22:05:28,377 INFO ]: Start isEmpty. Operand 120 states and 343 transitions. [2018-06-26 22:05:28,377 INFO ]: Finished isEmpty. Found accepting run of length 115 [2018-06-26 22:05:28,377 INFO ]: Found error trace [2018-06-26 22:05:28,377 INFO ]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:28,378 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:28,378 INFO ]: Analyzing trace with hash 1418840497, now seen corresponding path program 24 times [2018-06-26 22:05:28,378 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:28,378 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:28,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:28,378 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:28,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:28,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:28,703 INFO ]: Checked inductivity of 5995 backedges. 2981 proven. 2655 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-06-26 22:05:28,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:28,703 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) [2018-06-26 22:05:28,717 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:05:29,111 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-06-26 22:05:29,111 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:29,120 INFO ]: Computing forward predicates... [2018-06-26 22:05:29,167 INFO ]: Checked inductivity of 5995 backedges. 2978 proven. 2655 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-06-26 22:05:29,187 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:29,187 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 22:05:29,187 INFO ]: Interpolant automaton has 16 states [2018-06-26 22:05:29,187 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 22:05:29,187 INFO ]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:05:29,187 INFO ]: Start difference. First operand 120 states and 343 transitions. Second operand 16 states. [2018-06-26 22:05:29,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:29,884 INFO ]: Finished difference Result 189 states and 528 transitions. [2018-06-26 22:05:29,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:05:29,884 INFO ]: Start accepts. Automaton has 16 states. Word has length 114 [2018-06-26 22:05:29,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:29,885 INFO ]: With dead ends: 189 [2018-06-26 22:05:29,885 INFO ]: Without dead ends: 128 [2018-06-26 22:05:29,885 INFO ]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:05:29,885 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-26 22:05:29,888 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-06-26 22:05:29,888 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-26 22:05:29,888 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 355 transitions. [2018-06-26 22:05:29,888 INFO ]: Start accepts. Automaton has 124 states and 355 transitions. Word has length 114 [2018-06-26 22:05:29,889 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:29,889 INFO ]: Abstraction has 124 states and 355 transitions. [2018-06-26 22:05:29,889 INFO ]: Interpolant automaton has 16 states. [2018-06-26 22:05:29,889 INFO ]: Start isEmpty. Operand 124 states and 355 transitions. [2018-06-26 22:05:29,889 INFO ]: Finished isEmpty. Found accepting run of length 119 [2018-06-26 22:05:29,889 INFO ]: Found error trace [2018-06-26 22:05:29,889 INFO ]: trace histogram [14, 14, 14, 14, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:29,889 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:29,890 INFO ]: Analyzing trace with hash 256424681, now seen corresponding path program 25 times [2018-06-26 22:05:29,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:29,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:29,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:29,890 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:29,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:29,939 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:30,382 INFO ]: Checked inductivity of 6441 backedges. 3410 proven. 2655 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-06-26 22:05:30,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:30,383 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 22:05:30,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:30,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:30,620 INFO ]: Computing forward predicates... [2018-06-26 22:05:30,664 INFO ]: Checked inductivity of 6441 backedges. 3410 proven. 2655 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2018-06-26 22:05:30,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:30,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-26 22:05:30,699 INFO ]: Interpolant automaton has 16 states [2018-06-26 22:05:30,699 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 22:05:30,700 INFO ]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:05:30,700 INFO ]: Start difference. First operand 124 states and 355 transitions. Second operand 16 states. [2018-06-26 22:05:31,435 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:31,435 INFO ]: Finished difference Result 135 states and 388 transitions. [2018-06-26 22:05:31,435 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 22:05:31,435 INFO ]: Start accepts. Automaton has 16 states. Word has length 118 [2018-06-26 22:05:31,435 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:31,436 INFO ]: With dead ends: 135 [2018-06-26 22:05:31,436 INFO ]: Without dead ends: 134 [2018-06-26 22:05:31,436 INFO ]: 0 DeclaredPredicates, 226 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-06-26 22:05:31,436 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 22:05:31,438 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 128. [2018-06-26 22:05:31,438 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-26 22:05:31,439 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 366 transitions. [2018-06-26 22:05:31,439 INFO ]: Start accepts. Automaton has 128 states and 366 transitions. Word has length 118 [2018-06-26 22:05:31,440 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:31,440 INFO ]: Abstraction has 128 states and 366 transitions. [2018-06-26 22:05:31,440 INFO ]: Interpolant automaton has 16 states. [2018-06-26 22:05:31,440 INFO ]: Start isEmpty. Operand 128 states and 366 transitions. [2018-06-26 22:05:31,441 INFO ]: Finished isEmpty. Found accepting run of length 123 [2018-06-26 22:05:31,441 INFO ]: Found error trace [2018-06-26 22:05:31,441 INFO ]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:31,441 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:31,441 INFO ]: Analyzing trace with hash 299135614, now seen corresponding path program 26 times [2018-06-26 22:05:31,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:31,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:31,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:31,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:05:31,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:31,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:32,247 INFO ]: Checked inductivity of 6903 backedges. 3433 proven. 3083 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-06-26 22:05:32,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:32,247 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 22:05:32,254 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:05:32,485 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:05:32,485 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:32,496 INFO ]: Computing forward predicates... [2018-06-26 22:05:32,544 INFO ]: Checked inductivity of 6903 backedges. 3433 proven. 3083 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2018-06-26 22:05:32,578 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:32,578 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 22:05:32,578 INFO ]: Interpolant automaton has 17 states [2018-06-26 22:05:32,578 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 22:05:32,578 INFO ]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:05:32,578 INFO ]: Start difference. First operand 128 states and 366 transitions. Second operand 17 states. [2018-06-26 22:05:35,028 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:35,028 INFO ]: Finished difference Result 201 states and 562 transitions. [2018-06-26 22:05:35,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 22:05:35,031 INFO ]: Start accepts. Automaton has 17 states. Word has length 122 [2018-06-26 22:05:35,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:35,032 INFO ]: With dead ends: 201 [2018-06-26 22:05:35,032 INFO ]: Without dead ends: 136 [2018-06-26 22:05:35,032 INFO ]: 0 DeclaredPredicates, 237 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:05:35,032 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-26 22:05:35,035 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-06-26 22:05:35,035 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-26 22:05:35,037 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 378 transitions. [2018-06-26 22:05:35,037 INFO ]: Start accepts. Automaton has 132 states and 378 transitions. Word has length 122 [2018-06-26 22:05:35,037 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:35,037 INFO ]: Abstraction has 132 states and 378 transitions. [2018-06-26 22:05:35,037 INFO ]: Interpolant automaton has 17 states. [2018-06-26 22:05:35,037 INFO ]: Start isEmpty. Operand 132 states and 378 transitions. [2018-06-26 22:05:35,038 INFO ]: Finished isEmpty. Found accepting run of length 127 [2018-06-26 22:05:35,038 INFO ]: Found error trace [2018-06-26 22:05:35,038 INFO ]: trace histogram [15, 15, 15, 15, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:35,038 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:35,038 INFO ]: Analyzing trace with hash -1845318730, now seen corresponding path program 27 times [2018-06-26 22:05:35,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:35,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:35,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:35,039 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:35,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:35,093 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:36,020 INFO ]: Checked inductivity of 7381 backedges. 3894 proven. 3083 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-06-26 22:05:36,020 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:36,021 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 22:05:36,028 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:05:36,509 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-06-26 22:05:36,509 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:36,519 INFO ]: Computing forward predicates... [2018-06-26 22:05:36,564 INFO ]: Checked inductivity of 7381 backedges. 3894 proven. 3083 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-06-26 22:05:36,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:36,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 22:05:36,587 INFO ]: Interpolant automaton has 17 states [2018-06-26 22:05:36,587 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 22:05:36,587 INFO ]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:05:36,587 INFO ]: Start difference. First operand 132 states and 378 transitions. Second operand 17 states. [2018-06-26 22:05:37,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:05:37,198 INFO ]: Finished difference Result 143 states and 411 transitions. [2018-06-26 22:05:37,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 22:05:37,198 INFO ]: Start accepts. Automaton has 17 states. Word has length 126 [2018-06-26 22:05:37,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:05:37,199 INFO ]: With dead ends: 143 [2018-06-26 22:05:37,199 INFO ]: Without dead ends: 142 [2018-06-26 22:05:37,199 INFO ]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-06-26 22:05:37,200 INFO ]: Start minimizeSevpa. Operand 142 states. [2018-06-26 22:05:37,202 INFO ]: Finished minimizeSevpa. Reduced states from 142 to 136. [2018-06-26 22:05:37,202 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-26 22:05:37,203 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 389 transitions. [2018-06-26 22:05:37,203 INFO ]: Start accepts. Automaton has 136 states and 389 transitions. Word has length 126 [2018-06-26 22:05:37,204 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:05:37,204 INFO ]: Abstraction has 136 states and 389 transitions. [2018-06-26 22:05:37,204 INFO ]: Interpolant automaton has 17 states. [2018-06-26 22:05:37,204 INFO ]: Start isEmpty. Operand 136 states and 389 transitions. [2018-06-26 22:05:37,204 INFO ]: Finished isEmpty. Found accepting run of length 131 [2018-06-26 22:05:37,204 INFO ]: Found error trace [2018-06-26 22:05:37,205 INFO ]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 22:05:37,205 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:05:37,205 INFO ]: Analyzing trace with hash -782289717, now seen corresponding path program 28 times [2018-06-26 22:05:37,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:05:37,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:05:37,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:37,205 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:05:37,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:05:37,264 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:37,614 INFO ]: Checked inductivity of 7875 backedges. 3917 proven. 3543 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2018-06-26 22:05:37,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:05:37,614 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 22:05:37,620 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 22:05:37,861 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 22:05:37,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:05:37,873 INFO ]: Computing forward predicates... [2018-06-26 22:05:37,924 INFO ]: Checked inductivity of 7875 backedges. 3917 proven. 3543 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2018-06-26 22:05:37,957 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:05:37,957 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-26 22:05:37,957 INFO ]: Interpolant automaton has 18 states [2018-06-26 22:05:37,957 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 22:05:37,957 INFO ]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-06-26 22:05:37,957 INFO ]: Start difference. First operand 136 states and 389 transitions. Second operand 18 states. Received shutdown request... [2018-06-26 22:05:39,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 22:05:39,008 WARN ]: Verification canceled [2018-06-26 22:05:39,012 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:05:39,014 WARN ]: Timeout [2018-06-26 22:05:39,014 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:05:39 BasicIcfg [2018-06-26 22:05:39,014 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:05:39,015 INFO ]: Toolchain (without parser) took 52051.03 ms. Allocated memory was 303.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 257.9 MB in the beginning and 838.6 MB in the end (delta: -580.6 MB). Peak memory consumption was 699.7 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,016 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:05:39,016 INFO ]: ChcToBoogie took 55.27 ms. Allocated memory is still 303.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,016 INFO ]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,017 INFO ]: RCFGBuilder took 244.42 ms. Allocated memory is still 303.6 MB. Free memory was 253.9 MB in the beginning and 245.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,017 INFO ]: BlockEncodingV2 took 4860.54 ms. Allocated memory was 303.6 MB in the beginning and 1.1 GB in the end (delta: 818.4 MB). Free memory was 245.9 MB in the beginning and 783.2 MB in the end (delta: -537.3 MB). Peak memory consumption was 785.3 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,019 INFO ]: TraceAbstraction took 46849.21 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 461.9 MB). Free memory was 783.2 MB in the beginning and 838.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 406.6 MB. Max. memory is 3.6 GB. [2018-06-26 22:05:39,022 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 127 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.27 ms. Allocated memory is still 303.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 303.6 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 244.42 ms. Allocated memory is still 303.6 MB. Free memory was 253.9 MB in the beginning and 245.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 4860.54 ms. Allocated memory was 303.6 MB in the beginning and 1.1 GB in the end (delta: 818.4 MB). Free memory was 245.9 MB in the beginning and 783.2 MB in the end (delta: -537.3 MB). Peak memory consumption was 785.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46849.21 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 461.9 MB). Free memory was 783.2 MB in the beginning and 838.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 406.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (136states) and interpolant automaton (currently 18 states, 18 states before enhancement), while ReachableStatesComputation was computing reachable states (200 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 46.7s OverallTime, 40 OverallIterations, 15 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 221 SDtfs, 23 SDslu, 648 SDs, 0 SdLazy, 18784 SolverSat, 9670 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4057 GetRequests, 3792 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 194 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 4392 NumberOfCodeBlocks, 4372 NumberOfCodeBlocksAsserted, 541 NumberOfCheckSat, 4324 ConstructedInterpolants, 0 QuantifiedInterpolants, 1074178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 43552 ConjunctsInSsa, 3770 ConjunctsInUnsatCore, 68 InterpolantComputations, 12 PerfectInterpolantSequences, 102370/172874 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/xy0.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-05-39-039.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy0.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-05-39-039.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy0.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-05-39-039.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/xy0.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-05-39-039.csv Completed graceful shutdown