java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:50:21,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:50:21,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:50:21,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:50:21,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:50:21,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:50:21,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:50:21,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:50:21,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:50:21,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:50:21,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:50:21,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:50:21,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:50:21,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:50:21,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:50:21,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:50:21,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:50:21,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:50:21,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:50:21,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:50:21,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:50:21,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:50:21,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:50:21,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:50:21,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:50:21,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:50:21,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:50:21,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:50:21,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:50:21,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:50:21,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:50:21,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:50:21,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:50:21,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:50:21,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:50:21,625 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:50:21,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:50:21,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:50:21,646 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:50:21,646 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:50:21,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:50:21,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:50:21,647 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:50:21,647 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:50:21,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:50:21,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:50:21,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:50:21,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:50:21,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:50:21,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:50:21,649 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:50:21,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:50:21,649 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:50:21,649 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:50:21,649 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:50:21,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:50:21,650 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:50:21,651 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:50:21,651 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:50:21,710 INFO ]: Repository-Root is: /tmp [2018-06-24 20:50:21,727 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:50:21,732 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:50:21,734 INFO ]: Initializing SmtParser... [2018-06-24 20:50:21,734 INFO ]: SmtParser initialized [2018-06-24 20:50:21,735 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 [2018-06-24 20:50:21,736 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:50:21,820 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 unknown [2018-06-24 20:50:21,997 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop3_merged_safe.c-1.smt2 [2018-06-24 20:50:22,001 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:50:22,007 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:50:22,008 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:50:22,008 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:50:22,008 INFO ]: ChcToBoogie initialized [2018-06-24 20:50:22,011 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:50:21" (1/1) ... [2018-06-24 20:50:22,071 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22 Unit [2018-06-24 20:50:22,071 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:50:22,072 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:50:22,072 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:50:22,072 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:50:22,093 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,093 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,101 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,101 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,105 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,107 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,115 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,117 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:50:22,117 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:50:22,117 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:50:22,117 INFO ]: RCFGBuilder initialized [2018-06-24 20:50:22,118 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:50:22,138 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:50:22,138 INFO ]: Found specification of procedure gotoProc Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:50:22,138 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:50:22,138 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:50:22,138 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:50:22,138 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:50:22,498 INFO ]: Using library mode [2018-06-24 20:50:22,499 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:22 BoogieIcfgContainer [2018-06-24 20:50:22,499 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:50:22,500 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:50:22,500 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:50:22,501 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:50:22,501 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:22" (1/1) ... [2018-06-24 20:50:22,519 INFO ]: Initial Icfg 14 locations, 19 edges [2018-06-24 20:50:22,520 INFO ]: Using Remove infeasible edges [2018-06-24 20:50:22,521 INFO ]: Using Maximize final states [2018-06-24 20:50:22,521 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:50:22,521 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:50:22,527 INFO ]: Using Remove sink states [2018-06-24 20:50:22,528 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:50:22,528 INFO ]: Using Use SBE [2018-06-24 20:50:22,533 INFO ]: SBE split 0 edges [2018-06-24 20:50:22,539 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:50:22,545 INFO ]: 0 new accepting states [2018-06-24 20:50:22,681 INFO ]: Removed 16 edges and 5 locations by large block encoding [2018-06-24 20:50:22,684 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:50:22,685 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:50:22,685 INFO ]: 0 new accepting states [2018-06-24 20:50:22,685 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:50:22,685 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:50:22,686 INFO ]: Encoded RCFG 7 locations, 12 edges [2018-06-24 20:50:22,686 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:50:22 BasicIcfg [2018-06-24 20:50:22,686 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:50:22,687 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:50:22,687 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:50:22,690 INFO ]: TraceAbstraction initialized [2018-06-24 20:50:22,690 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:50:21" (1/4) ... [2018-06-24 20:50:22,691 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1375f1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:50:22, skipping insertion in model container [2018-06-24 20:50:22,691 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:50:22" (2/4) ... [2018-06-24 20:50:22,692 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1375f1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:50:22, skipping insertion in model container [2018-06-24 20:50:22,692 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:50:22" (3/4) ... [2018-06-24 20:50:22,692 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1375f1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:50:22, skipping insertion in model container [2018-06-24 20:50:22,692 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:50:22" (4/4) ... [2018-06-24 20:50:22,694 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:50:22,705 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:50:22,719 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:50:22,770 INFO ]: Using default assertion order modulation [2018-06-24 20:50:22,771 INFO ]: Interprodecural is true [2018-06-24 20:50:22,771 INFO ]: Hoare is false [2018-06-24 20:50:22,771 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:50:22,771 INFO ]: Backedges is TWOTRACK [2018-06-24 20:50:22,771 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:50:22,771 INFO ]: Difference is false [2018-06-24 20:50:22,771 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:50:22,771 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:50:22,784 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:50:22,805 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:50:22,805 INFO ]: Found error trace [2018-06-24 20:50:22,806 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:50:22,806 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:22,814 INFO ]: Analyzing trace with hash 34853160, now seen corresponding path program 1 times [2018-06-24 20:50:22,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:22,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:22,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:22,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:22,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:22,897 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:22,993 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:22,995 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:22,995 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:50:22,996 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:50:23,008 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:50:23,008 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:23,010 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:50:23,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:23,133 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-24 20:50:23,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:23,135 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:50:23,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:23,146 INFO ]: With dead ends: 8 [2018-06-24 20:50:23,146 INFO ]: Without dead ends: 8 [2018-06-24 20:50:23,150 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-24 20:50:23,165 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:50:23,182 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:50:23,183 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:23,184 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-24 20:50:23,185 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2018-06-24 20:50:23,186 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:23,186 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-24 20:50:23,186 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:50:23,186 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-24 20:50:23,186 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:50:23,186 INFO ]: Found error trace [2018-06-24 20:50:23,186 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:50:23,186 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:23,187 INFO ]: Analyzing trace with hash 34942533, now seen corresponding path program 1 times [2018-06-24 20:50:23,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:23,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:23,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:23,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,205 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:23,286 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:23,286 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:23,286 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:50:23,288 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:50:23,288 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:50:23,288 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:50:23,288 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-06-24 20:50:23,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:23,398 INFO ]: Finished difference Result 9 states and 14 transitions. [2018-06-24 20:50:23,399 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:23,399 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:50:23,399 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:23,399 INFO ]: With dead ends: 9 [2018-06-24 20:50:23,399 INFO ]: Without dead ends: 9 [2018-06-24 20:50:23,400 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-24 20:50:23,400 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:50:23,401 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:50:23,401 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:23,402 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-24 20:50:23,402 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2018-06-24 20:50:23,402 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:23,402 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-24 20:50:23,402 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:50:23,402 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-24 20:50:23,402 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:50:23,402 INFO ]: Found error trace [2018-06-24 20:50:23,402 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:50:23,402 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:23,402 INFO ]: Analyzing trace with hash 1080308723, now seen corresponding path program 1 times [2018-06-24 20:50:23,402 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:23,402 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:23,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:23,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,429 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:23,639 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:23,639 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:23,639 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:23,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:23,693 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:23,701 INFO ]: Computing forward predicates... [2018-06-24 20:50:23,737 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:50:23,756 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:50:23,756 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-24 20:50:23,757 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:50:23,757 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:50:23,757 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:50:23,757 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 4 states. [2018-06-24 20:50:23,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:23,885 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 20:50:23,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:50:23,886 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:50:23,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:23,886 INFO ]: With dead ends: 10 [2018-06-24 20:50:23,886 INFO ]: Without dead ends: 8 [2018-06-24 20:50:23,886 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:50:23,886 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:50:23,888 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:50:23,888 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:50:23,888 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:50:23,888 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-24 20:50:23,888 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:23,888 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:50:23,888 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:50:23,888 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:50:23,888 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:50:23,888 INFO ]: Found error trace [2018-06-24 20:50:23,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:50:23,889 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:23,889 INFO ]: Analyzing trace with hash 1083079286, now seen corresponding path program 1 times [2018-06-24 20:50:23,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:23,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:23,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:23,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:23,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:23,982 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:23,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:23,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:23,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:24,023 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,025 INFO ]: Computing forward predicates... [2018-06-24 20:50:24,063 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:24,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:24,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:50:24,083 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:50:24,083 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:50:24,083 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:24,083 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 5 states. [2018-06-24 20:50:24,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:24,208 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 20:50:24,209 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:50:24,209 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-24 20:50:24,209 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:24,209 INFO ]: With dead ends: 10 [2018-06-24 20:50:24,209 INFO ]: Without dead ends: 10 [2018-06-24 20:50:24,209 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:24,209 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:50:24,212 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 20:50:24,212 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:50:24,212 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-24 20:50:24,212 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 6 [2018-06-24 20:50:24,212 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:24,212 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-24 20:50:24,212 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:50:24,212 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-24 20:50:24,212 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:50:24,212 INFO ]: Found error trace [2018-06-24 20:50:24,212 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:24,213 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:24,213 INFO ]: Analyzing trace with hash -976512107, now seen corresponding path program 1 times [2018-06-24 20:50:24,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:24,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:24,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:24,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,300 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:50:24,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:50:24,300 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:50:24,300 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:50:24,300 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:50:24,300 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:50:24,300 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-24 20:50:24,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:24,485 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-24 20:50:24,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:50:24,485 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:50:24,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:24,486 INFO ]: With dead ends: 12 [2018-06-24 20:50:24,486 INFO ]: Without dead ends: 9 [2018-06-24 20:50:24,486 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:24,486 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:50:24,487 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:50:24,487 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:50:24,488 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-06-24 20:50:24,488 INFO ]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 7 [2018-06-24 20:50:24,488 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:24,488 INFO ]: Abstraction has 9 states and 12 transitions. [2018-06-24 20:50:24,488 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:50:24,488 INFO ]: Start isEmpty. Operand 9 states and 12 transitions. [2018-06-24 20:50:24,488 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:50:24,488 INFO ]: Found error trace [2018-06-24 20:50:24,488 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:24,488 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:24,489 INFO ]: Analyzing trace with hash -833366352, now seen corresponding path program 1 times [2018-06-24 20:50:24,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:24,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:24,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:24,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,535 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:24,535 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:24,535 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:24,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:24,559 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,561 INFO ]: Computing forward predicates... [2018-06-24 20:50:24,585 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:24,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:24,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-24 20:50:24,605 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:50:24,605 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:50:24,605 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:24,605 INFO ]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2018-06-24 20:50:24,617 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:24,618 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-24 20:50:24,618 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:50:24,618 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:50:24,618 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:24,619 INFO ]: With dead ends: 11 [2018-06-24 20:50:24,619 INFO ]: Without dead ends: 11 [2018-06-24 20:50:24,619 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:50:24,619 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:50:24,620 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 20:50:24,620 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:50:24,620 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-06-24 20:50:24,620 INFO ]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 7 [2018-06-24 20:50:24,621 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:24,621 INFO ]: Abstraction has 9 states and 12 transitions. [2018-06-24 20:50:24,621 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:50:24,621 INFO ]: Start isEmpty. Operand 9 states and 12 transitions. [2018-06-24 20:50:24,621 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:50:24,621 INFO ]: Found error trace [2018-06-24 20:50:24,621 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-24 20:50:24,621 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:24,621 INFO ]: Analyzing trace with hash -784419739, now seen corresponding path program 2 times [2018-06-24 20:50:24,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:24,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:24,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:24,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:24,633 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,835 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:24,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:24,835 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 20:50:24,853 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:24,899 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:24,899 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:24,901 INFO ]: Computing forward predicates... [2018-06-24 20:50:25,011 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:25,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:25,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 20:50:25,030 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:50:25,030 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:50:25,030 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:50:25,031 INFO ]: Start difference. First operand 9 states and 12 transitions. Second operand 6 states. [2018-06-24 20:50:25,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:25,162 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-24 20:50:25,164 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:50:25,164 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 20:50:25,164 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:25,166 INFO ]: With dead ends: 13 [2018-06-24 20:50:25,166 INFO ]: Without dead ends: 10 [2018-06-24 20:50:25,166 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:50:25,166 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:50:25,168 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-24 20:50:25,168 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:50:25,168 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 20:50:25,168 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-06-24 20:50:25,168 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:25,168 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 20:50:25,168 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:50:25,168 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 20:50:25,168 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:50:25,168 INFO ]: Found error trace [2018-06-24 20:50:25,168 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:25,168 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:25,168 INFO ]: Analyzing trace with hash -64692373, now seen corresponding path program 2 times [2018-06-24 20:50:25,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:25,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:25,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:25,169 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:25,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:25,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:25,266 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:25,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:25,266 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:25,274 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:25,297 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:25,297 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:25,299 INFO ]: Computing forward predicates... [2018-06-24 20:50:25,562 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:25,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:25,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 20:50:25,594 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:50:25,594 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:50:25,594 INFO ]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:50:25,594 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2018-06-24 20:50:25,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:25,932 INFO ]: Finished difference Result 15 states and 20 transitions. [2018-06-24 20:50:25,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:50:25,932 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-24 20:50:25,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:25,933 INFO ]: With dead ends: 15 [2018-06-24 20:50:25,933 INFO ]: Without dead ends: 15 [2018-06-24 20:50:25,933 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:50:25,933 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:50:25,934 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-06-24 20:50:25,935 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:50:25,935 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-24 20:50:25,935 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-24 20:50:25,935 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:25,935 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-24 20:50:25,935 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:50:25,935 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-24 20:50:25,935 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:50:25,935 INFO ]: Found error trace [2018-06-24 20:50:25,935 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:25,936 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:25,936 INFO ]: Analyzing trace with hash 772019493, now seen corresponding path program 1 times [2018-06-24 20:50:25,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:25,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:25,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:25,937 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:25,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:25,956 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,032 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:26,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:26,033 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:26,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:26,058 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,061 INFO ]: Computing forward predicates... [2018-06-24 20:50:26,108 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:26,133 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:26,133 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:50:26,134 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:50:26,134 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:50:26,134 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:50:26,134 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 7 states. [2018-06-24 20:50:26,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:26,232 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-24 20:50:26,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:50:26,232 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-24 20:50:26,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:26,233 INFO ]: With dead ends: 16 [2018-06-24 20:50:26,233 INFO ]: Without dead ends: 16 [2018-06-24 20:50:26,233 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:50:26,233 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:50:26,236 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-06-24 20:50:26,236 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:50:26,236 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:50:26,236 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 9 [2018-06-24 20:50:26,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:26,237 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:50:26,237 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:50:26,237 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:50:26,237 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:50:26,237 INFO ]: Found error trace [2018-06-24 20:50:26,237 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:26,237 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:26,237 INFO ]: Analyzing trace with hash -2005602800, now seen corresponding path program 3 times [2018-06-24 20:50:26,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:26,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:26,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:26,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:26,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:26,249 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,327 INFO ]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:26,327 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:26,327 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:26,335 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:26,360 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:50:26,360 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,362 INFO ]: Computing forward predicates... [2018-06-24 20:50:26,387 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:26,408 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:26,408 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 20:50:26,408 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:50:26,408 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:50:26,408 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:50:26,408 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 8 states. [2018-06-24 20:50:26,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:26,522 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:50:26,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:50:26,522 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 20:50:26,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:26,522 INFO ]: With dead ends: 16 [2018-06-24 20:50:26,522 INFO ]: Without dead ends: 12 [2018-06-24 20:50:26,522 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:50:26,522 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:50:26,524 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 20:50:26,524 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:50:26,524 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:50:26,524 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-24 20:50:26,524 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:26,524 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:50:26,524 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:50:26,524 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:50:26,525 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:50:26,525 INFO ]: Found error trace [2018-06-24 20:50:26,525 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:26,525 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:26,525 INFO ]: Analyzing trace with hash -1837338730, now seen corresponding path program 2 times [2018-06-24 20:50:26,525 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:26,525 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:26,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:26,525 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:26,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:26,537 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,906 INFO ]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:26,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:26,906 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:26,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:26,966 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:26,966 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:26,969 INFO ]: Computing forward predicates... [2018-06-24 20:50:27,021 INFO ]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:27,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:27,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 20:50:27,043 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:50:27,043 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:50:27,043 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:50:27,044 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 12 states. [2018-06-24 20:50:27,139 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:27,140 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-24 20:50:27,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:50:27,140 INFO ]: Start accepts. Automaton has 12 states. Word has length 10 [2018-06-24 20:50:27,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:27,140 INFO ]: With dead ends: 18 [2018-06-24 20:50:27,140 INFO ]: Without dead ends: 18 [2018-06-24 20:50:27,141 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:50:27,141 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:50:27,142 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-24 20:50:27,142 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:50:27,143 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-24 20:50:27,143 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-24 20:50:27,143 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:27,143 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-24 20:50:27,143 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:50:27,143 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-24 20:50:27,143 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:50:27,143 INFO ]: Found error trace [2018-06-24 20:50:27,143 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:27,143 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:27,143 INFO ]: Analyzing trace with hash -916119856, now seen corresponding path program 3 times [2018-06-24 20:50:27,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:27,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:27,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,144 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:27,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,153 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:27,346 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:27,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:27,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:27,351 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:27,398 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:50:27,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:27,400 INFO ]: Computing forward predicates... [2018-06-24 20:50:27,436 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:27,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:27,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:50:27,461 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:50:27,461 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:50:27,461 INFO ]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:50:27,461 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 9 states. [2018-06-24 20:50:27,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:27,614 INFO ]: Finished difference Result 19 states and 24 transitions. [2018-06-24 20:50:27,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:50:27,614 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-24 20:50:27,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:27,615 INFO ]: With dead ends: 19 [2018-06-24 20:50:27,615 INFO ]: Without dead ends: 19 [2018-06-24 20:50:27,615 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:50:27,615 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:50:27,617 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-06-24 20:50:27,617 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:50:27,617 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:50:27,617 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 11 [2018-06-24 20:50:27,617 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:27,617 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:50:27,617 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:50:27,617 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:50:27,618 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:50:27,618 INFO ]: Found error trace [2018-06-24 20:50:27,618 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:27,618 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:27,618 INFO ]: Analyzing trace with hash -1123065019, now seen corresponding path program 4 times [2018-06-24 20:50:27,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:27,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:27,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,618 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:27,618 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,628 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:27,721 INFO ]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:27,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:27,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:27,728 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:27,748 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:27,748 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:27,750 INFO ]: Computing forward predicates... [2018-06-24 20:50:27,774 INFO ]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:27,806 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:27,806 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 20:50:27,806 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:50:27,806 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:50:27,806 INFO ]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:50:27,806 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 10 states. [2018-06-24 20:50:27,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:27,932 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:50:27,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:50:27,932 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 20:50:27,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:27,932 INFO ]: With dead ends: 19 [2018-06-24 20:50:27,932 INFO ]: Without dead ends: 14 [2018-06-24 20:50:27,933 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:50:27,933 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:50:27,934 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-24 20:50:27,934 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:50:27,934 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:50:27,934 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-24 20:50:27,934 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:27,934 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:50:27,934 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:50:27,934 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:50:27,935 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:50:27,935 INFO ]: Found error trace [2018-06-24 20:50:27,935 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:27,935 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:27,935 INFO ]: Analyzing trace with hash 1664916299, now seen corresponding path program 5 times [2018-06-24 20:50:27,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:27,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:27,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:27,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:27,947 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:28,072 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:28,072 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:28,072 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:28,078 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:28,104 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:50:28,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:28,106 INFO ]: Computing forward predicates... [2018-06-24 20:50:28,190 INFO ]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:28,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:28,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-06-24 20:50:28,221 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:50:28,222 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:50:28,222 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:50:28,222 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 15 states. [2018-06-24 20:50:28,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:28,645 INFO ]: Finished difference Result 21 states and 26 transitions. [2018-06-24 20:50:28,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:50:28,645 INFO ]: Start accepts. Automaton has 15 states. Word has length 12 [2018-06-24 20:50:28,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:28,646 INFO ]: With dead ends: 21 [2018-06-24 20:50:28,646 INFO ]: Without dead ends: 21 [2018-06-24 20:50:28,646 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:28,646 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:50:28,648 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-06-24 20:50:28,648 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:50:28,648 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-06-24 20:50:28,648 INFO ]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12 [2018-06-24 20:50:28,648 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:28,648 INFO ]: Abstraction has 15 states and 18 transitions. [2018-06-24 20:50:28,648 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:50:28,648 INFO ]: Start isEmpty. Operand 15 states and 18 transitions. [2018-06-24 20:50:28,648 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:50:28,648 INFO ]: Found error trace [2018-06-24 20:50:28,649 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:28,649 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:28,649 INFO ]: Analyzing trace with hash -2101976059, now seen corresponding path program 6 times [2018-06-24 20:50:28,649 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:28,649 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:28,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:28,649 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:28,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:28,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:28,729 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:28,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:28,729 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:28,738 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:28,767 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:50:28,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:28,769 INFO ]: Computing forward predicates... [2018-06-24 20:50:28,789 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:28,808 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:28,808 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:50:28,808 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:50:28,808 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:50:28,809 INFO ]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:50:28,809 INFO ]: Start difference. First operand 15 states and 18 transitions. Second operand 11 states. [2018-06-24 20:50:28,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:28,961 INFO ]: Finished difference Result 22 states and 27 transitions. [2018-06-24 20:50:28,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:50:28,962 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-24 20:50:28,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:28,962 INFO ]: With dead ends: 22 [2018-06-24 20:50:28,962 INFO ]: Without dead ends: 22 [2018-06-24 20:50:28,963 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:50:28,963 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:50:28,964 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-06-24 20:50:28,964 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:50:28,964 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:50:28,964 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 13 [2018-06-24 20:50:28,965 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:28,965 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:50:28,965 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:50:28,965 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:50:28,965 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:50:28,965 INFO ]: Found error trace [2018-06-24 20:50:28,965 INFO ]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:28,965 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:28,965 INFO ]: Analyzing trace with hash 72658480, now seen corresponding path program 7 times [2018-06-24 20:50:28,965 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:28,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:28,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:28,967 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:28,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:28,977 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:29,278 INFO ]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:29,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:29,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:29,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:29,309 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:29,311 INFO ]: Computing forward predicates... [2018-06-24 20:50:29,371 INFO ]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:29,390 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:29,390 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:50:29,390 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:50:29,390 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:50:29,390 INFO ]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:50:29,391 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 12 states. [2018-06-24 20:50:29,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:29,477 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-24 20:50:29,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:50:29,477 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 20:50:29,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:29,477 INFO ]: With dead ends: 22 [2018-06-24 20:50:29,477 INFO ]: Without dead ends: 16 [2018-06-24 20:50:29,477 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:50:29,478 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:50:29,479 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-06-24 20:50:29,479 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:50:29,479 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-24 20:50:29,479 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2018-06-24 20:50:29,479 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:29,479 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-24 20:50:29,479 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:50:29,479 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-24 20:50:29,480 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:50:29,480 INFO ]: Found error trace [2018-06-24 20:50:29,480 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:29,480 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:29,480 INFO ]: Analyzing trace with hash -736887626, now seen corresponding path program 8 times [2018-06-24 20:50:29,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:29,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:29,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:29,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:29,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:29,492 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:29,701 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:29,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:29,701 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:29,707 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:29,732 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:29,732 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:29,735 INFO ]: Computing forward predicates... [2018-06-24 20:50:29,872 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:29,891 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:29,891 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-24 20:50:29,891 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:50:29,892 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:50:29,892 INFO ]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:50:29,892 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 18 states. [2018-06-24 20:50:30,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:30,143 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-24 20:50:30,144 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:50:30,144 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-24 20:50:30,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:30,144 INFO ]: With dead ends: 24 [2018-06-24 20:50:30,144 INFO ]: Without dead ends: 24 [2018-06-24 20:50:30,145 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:50:30,145 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:50:30,146 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-06-24 20:50:30,146 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:50:30,147 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-24 20:50:30,147 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-24 20:50:30,147 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:30,147 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-24 20:50:30,147 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:50:30,147 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-24 20:50:30,147 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:50:30,147 INFO ]: Found error trace [2018-06-24 20:50:30,147 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:30,147 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:30,147 INFO ]: Analyzing trace with hash -63013136, now seen corresponding path program 9 times [2018-06-24 20:50:30,147 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:30,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:30,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:30,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:30,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:30,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:30,927 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:30,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:30,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:30,933 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:30,960 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:50:30,960 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:30,963 INFO ]: Computing forward predicates... [2018-06-24 20:50:31,000 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:31,019 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:31,019 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:50:31,019 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:50:31,019 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:50:31,019 INFO ]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:50:31,019 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 13 states. [2018-06-24 20:50:31,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:31,121 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-24 20:50:31,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:50:31,121 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-24 20:50:31,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:31,122 INFO ]: With dead ends: 25 [2018-06-24 20:50:31,122 INFO ]: Without dead ends: 25 [2018-06-24 20:50:31,122 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=349, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:50:31,122 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:50:31,124 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-06-24 20:50:31,124 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:50:31,124 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:50:31,124 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 15 [2018-06-24 20:50:31,124 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:31,124 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:50:31,124 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:50:31,125 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:50:31,125 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:50:31,125 INFO ]: Found error trace [2018-06-24 20:50:31,125 INFO ]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:31,125 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:31,125 INFO ]: Analyzing trace with hash -1368819163, now seen corresponding path program 10 times [2018-06-24 20:50:31,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:31,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:31,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:31,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:31,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:31,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:31,237 INFO ]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:31,238 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:31,238 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:31,243 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:31,278 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:31,278 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:31,281 INFO ]: Computing forward predicates... [2018-06-24 20:50:31,451 INFO ]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:31,470 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:31,470 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:50:31,470 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:50:31,470 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:50:31,470 INFO ]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:50:31,470 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2018-06-24 20:50:31,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:31,577 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:50:31,577 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:50:31,577 INFO ]: Start accepts. Automaton has 14 states. Word has length 15 [2018-06-24 20:50:31,578 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:31,578 INFO ]: With dead ends: 25 [2018-06-24 20:50:31,578 INFO ]: Without dead ends: 18 [2018-06-24 20:50:31,578 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:31,578 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:50:31,581 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-06-24 20:50:31,581 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:50:31,581 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-24 20:50:31,581 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-24 20:50:31,581 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:31,581 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-24 20:50:31,581 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:50:31,581 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-24 20:50:31,582 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:50:31,582 INFO ]: Found error trace [2018-06-24 20:50:31,582 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:31,582 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:31,582 INFO ]: Analyzing trace with hash -1953546453, now seen corresponding path program 11 times [2018-06-24 20:50:31,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:31,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:31,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:31,582 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:31,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:31,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:31,890 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:31,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:31,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:31,907 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:31,940 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:50:31,940 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:31,944 INFO ]: Computing forward predicates... [2018-06-24 20:50:32,157 INFO ]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:32,176 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:32,176 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-06-24 20:50:32,176 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:50:32,176 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:50:32,176 INFO ]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:50:32,176 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 21 states. [2018-06-24 20:50:32,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:32,462 INFO ]: Finished difference Result 27 states and 32 transitions. [2018-06-24 20:50:32,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:50:32,462 INFO ]: Start accepts. Automaton has 21 states. Word has length 16 [2018-06-24 20:50:32,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:32,463 INFO ]: With dead ends: 27 [2018-06-24 20:50:32,463 INFO ]: Without dead ends: 27 [2018-06-24 20:50:32,463 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:50:32,463 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:50:32,465 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-06-24 20:50:32,465 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:50:32,465 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-24 20:50:32,466 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-24 20:50:32,466 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:32,466 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-24 20:50:32,466 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:50:32,466 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-24 20:50:32,466 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:50:32,466 INFO ]: Found error trace [2018-06-24 20:50:32,466 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:32,466 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:32,466 INFO ]: Analyzing trace with hash 1394744037, now seen corresponding path program 12 times [2018-06-24 20:50:32,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:32,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:32,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:32,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:32,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:32,478 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:32,685 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:32,685 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:32,685 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:32,691 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:32,725 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:50:32,725 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:32,728 INFO ]: Computing forward predicates... [2018-06-24 20:50:32,792 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:32,812 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:32,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:50:32,813 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:50:32,813 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:50:32,813 INFO ]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:50:32,813 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 15 states. [2018-06-24 20:50:33,123 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:33,123 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-24 20:50:33,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:50:33,123 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-24 20:50:33,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:33,123 INFO ]: With dead ends: 28 [2018-06-24 20:50:33,123 INFO ]: Without dead ends: 28 [2018-06-24 20:50:33,124 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:50:33,124 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:50:33,125 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-06-24 20:50:33,125 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:50:33,125 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:50:33,126 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2018-06-24 20:50:33,126 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:33,126 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:50:33,126 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:50:33,126 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:50:33,126 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:50:33,126 INFO ]: Found error trace [2018-06-24 20:50:33,126 INFO ]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:33,126 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:33,126 INFO ]: Analyzing trace with hash -430537136, now seen corresponding path program 13 times [2018-06-24 20:50:33,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:33,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:33,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:33,127 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:33,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:33,137 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:33,553 INFO ]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:33,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:33,553 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:33,560 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:33,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:33,594 INFO ]: Computing forward predicates... [2018-06-24 20:50:33,625 INFO ]: Checked inductivity of 38 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:33,643 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:33,643 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 20:50:33,643 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:50:33,643 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:50:33,643 INFO ]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:50:33,644 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-24 20:50:33,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:33,814 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-24 20:50:33,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:50:33,814 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 20:50:33,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:33,814 INFO ]: With dead ends: 28 [2018-06-24 20:50:33,814 INFO ]: Without dead ends: 20 [2018-06-24 20:50:33,815 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:50:33,815 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:50:33,816 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-06-24 20:50:33,816 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:50:33,816 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-24 20:50:33,816 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-06-24 20:50:33,816 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:33,816 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-24 20:50:33,816 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:50:33,816 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-24 20:50:33,817 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:50:33,817 INFO ]: Found error trace [2018-06-24 20:50:33,817 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:33,817 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:33,817 INFO ]: Analyzing trace with hash 287252950, now seen corresponding path program 14 times [2018-06-24 20:50:33,817 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:33,817 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:33,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:33,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:33,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:33,840 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:34,532 INFO ]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:34,532 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:34,532 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:34,538 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:34,569 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:34,569 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:34,572 INFO ]: Computing forward predicates... [2018-06-24 20:50:34,689 INFO ]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:34,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:34,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2018-06-24 20:50:34,708 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:50:34,708 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:50:34,708 INFO ]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:50:34,709 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 24 states. [2018-06-24 20:50:34,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:34,994 INFO ]: Finished difference Result 30 states and 35 transitions. [2018-06-24 20:50:34,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:50:34,995 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-24 20:50:34,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:34,995 INFO ]: With dead ends: 30 [2018-06-24 20:50:34,995 INFO ]: Without dead ends: 30 [2018-06-24 20:50:34,996 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:50:34,996 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:50:34,997 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-06-24 20:50:34,997 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:50:34,997 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-06-24 20:50:34,998 INFO ]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2018-06-24 20:50:34,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:34,998 INFO ]: Abstraction has 21 states and 24 transitions. [2018-06-24 20:50:34,998 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:50:34,998 INFO ]: Start isEmpty. Operand 21 states and 24 transitions. [2018-06-24 20:50:34,998 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:50:34,998 INFO ]: Found error trace [2018-06-24 20:50:34,998 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:34,998 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:34,998 INFO ]: Analyzing trace with hash 1063909136, now seen corresponding path program 15 times [2018-06-24 20:50:34,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:34,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:34,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:34,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:34,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:35,010 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:35,190 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:35,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:35,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:35,205 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:35,243 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:50:35,243 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:35,246 INFO ]: Computing forward predicates... [2018-06-24 20:50:35,318 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:35,338 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:35,338 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:50:35,338 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:50:35,338 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:50:35,338 INFO ]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:50:35,338 INFO ]: Start difference. First operand 21 states and 24 transitions. Second operand 17 states. [2018-06-24 20:50:35,517 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:35,517 INFO ]: Finished difference Result 31 states and 36 transitions. [2018-06-24 20:50:35,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:50:35,517 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-24 20:50:35,518 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:35,518 INFO ]: With dead ends: 31 [2018-06-24 20:50:35,518 INFO ]: Without dead ends: 31 [2018-06-24 20:50:35,518 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=634, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:50:35,518 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:50:35,519 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-06-24 20:50:35,519 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:50:35,520 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:50:35,520 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 19 [2018-06-24 20:50:35,520 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:35,520 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:50:35,520 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:50:35,520 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:50:35,520 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:50:35,520 INFO ]: Found error trace [2018-06-24 20:50:35,520 INFO ]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:35,520 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:35,520 INFO ]: Analyzing trace with hash 314767621, now seen corresponding path program 16 times [2018-06-24 20:50:35,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:35,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:35,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:35,521 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:35,521 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:35,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:35,759 INFO ]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:35,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:35,759 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:35,764 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:35,798 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:35,798 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:35,801 INFO ]: Computing forward predicates... [2018-06-24 20:50:35,851 INFO ]: Checked inductivity of 51 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:35,870 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:35,870 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:50:35,870 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:50:35,870 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:50:35,871 INFO ]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:50:35,871 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 18 states. [2018-06-24 20:50:36,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:36,126 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-24 20:50:36,126 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:50:36,126 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-24 20:50:36,126 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:36,126 INFO ]: With dead ends: 31 [2018-06-24 20:50:36,126 INFO ]: Without dead ends: 22 [2018-06-24 20:50:36,126 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:50:36,126 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:50:36,128 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-24 20:50:36,128 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:50:36,128 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-24 20:50:36,128 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-06-24 20:50:36,128 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:36,128 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-24 20:50:36,128 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:50:36,128 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-24 20:50:36,128 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:50:36,128 INFO ]: Found error trace [2018-06-24 20:50:36,129 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:36,129 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:36,129 INFO ]: Analyzing trace with hash -1378694389, now seen corresponding path program 17 times [2018-06-24 20:50:36,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:36,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:36,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:36,129 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:36,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:36,142 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:37,683 INFO ]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:37,683 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:37,683 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:37,689 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:37,731 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:50:37,731 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:37,734 INFO ]: Computing forward predicates... [2018-06-24 20:50:37,889 INFO ]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:37,908 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:37,908 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 27 [2018-06-24 20:50:37,909 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:50:37,909 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:50:37,909 INFO ]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:50:37,909 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 27 states. [2018-06-24 20:50:38,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:38,603 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-24 20:50:38,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:50:38,603 INFO ]: Start accepts. Automaton has 27 states. Word has length 20 [2018-06-24 20:50:38,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:38,603 INFO ]: With dead ends: 33 [2018-06-24 20:50:38,603 INFO ]: Without dead ends: 33 [2018-06-24 20:50:38,604 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:50:38,604 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:50:38,605 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-06-24 20:50:38,605 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:50:38,605 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-24 20:50:38,606 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-24 20:50:38,606 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:38,606 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-24 20:50:38,606 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:50:38,606 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-24 20:50:38,606 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:50:38,606 INFO ]: Found error trace [2018-06-24 20:50:38,606 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:38,606 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:38,606 INFO ]: Analyzing trace with hash 1958558149, now seen corresponding path program 18 times [2018-06-24 20:50:38,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:38,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:38,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:38,607 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:38,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:38,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:38,951 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:38,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:38,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:38,956 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:39,004 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:50:39,004 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:39,007 INFO ]: Computing forward predicates... [2018-06-24 20:50:39,103 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:39,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:39,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:50:39,122 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:50:39,122 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:50:39,122 INFO ]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:50:39,123 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 19 states. [2018-06-24 20:50:39,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:39,317 INFO ]: Finished difference Result 34 states and 39 transitions. [2018-06-24 20:50:39,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:50:39,317 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-24 20:50:39,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:39,317 INFO ]: With dead ends: 34 [2018-06-24 20:50:39,317 INFO ]: Without dead ends: 34 [2018-06-24 20:50:39,317 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=808, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:50:39,318 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:50:39,319 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 22. [2018-06-24 20:50:39,319 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:50:39,319 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-24 20:50:39,320 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 21 [2018-06-24 20:50:39,320 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:39,320 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-24 20:50:39,320 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:50:39,320 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-24 20:50:39,320 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:50:39,320 INFO ]: Found error trace [2018-06-24 20:50:39,320 INFO ]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:39,320 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:39,320 INFO ]: Analyzing trace with hash 210007664, now seen corresponding path program 19 times [2018-06-24 20:50:39,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:39,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:39,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:39,321 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:39,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:39,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:39,521 INFO ]: Checked inductivity of 66 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:39,521 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:39,521 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:39,527 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:39,573 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:39,577 INFO ]: Computing forward predicates... [2018-06-24 20:50:39,614 INFO ]: Checked inductivity of 66 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:39,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:39,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 20:50:39,633 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:50:39,633 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:50:39,633 INFO ]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:50:39,633 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 20 states. [2018-06-24 20:50:39,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:39,818 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-24 20:50:39,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:50:39,818 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-24 20:50:39,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:39,818 INFO ]: With dead ends: 34 [2018-06-24 20:50:39,818 INFO ]: Without dead ends: 24 [2018-06-24 20:50:39,819 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:50:39,819 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:50:39,820 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-06-24 20:50:39,820 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:50:39,821 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-24 20:50:39,821 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2018-06-24 20:50:39,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:39,821 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-24 20:50:39,821 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:50:39,821 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-24 20:50:39,821 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:50:39,821 INFO ]: Found error trace [2018-06-24 20:50:39,821 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:39,821 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:39,821 INFO ]: Analyzing trace with hash 585621238, now seen corresponding path program 20 times [2018-06-24 20:50:39,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:39,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:39,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:39,822 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:39,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:39,838 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:40,140 INFO ]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:40,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:40,140 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:40,146 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:40,186 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:40,186 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:40,190 INFO ]: Computing forward predicates... [2018-06-24 20:50:40,427 INFO ]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:40,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:40,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-06-24 20:50:40,459 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:50:40,460 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:50:40,460 INFO ]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:50:40,460 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 30 states. [2018-06-24 20:50:40,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:40,879 INFO ]: Finished difference Result 36 states and 41 transitions. [2018-06-24 20:50:40,879 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:50:40,879 INFO ]: Start accepts. Automaton has 30 states. Word has length 22 [2018-06-24 20:50:40,879 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:40,879 INFO ]: With dead ends: 36 [2018-06-24 20:50:40,879 INFO ]: Without dead ends: 36 [2018-06-24 20:50:40,880 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:50:40,880 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:50:40,882 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-06-24 20:50:40,882 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:50:40,882 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-24 20:50:40,882 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-06-24 20:50:40,882 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:40,882 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-24 20:50:40,882 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:50:40,882 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-24 20:50:40,882 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:50:40,883 INFO ]: Found error trace [2018-06-24 20:50:40,883 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:40,883 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:40,883 INFO ]: Analyzing trace with hash -655259856, now seen corresponding path program 21 times [2018-06-24 20:50:40,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:40,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:40,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:40,883 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:40,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:40,899 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:41,153 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:41,153 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:41,153 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:41,162 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:41,206 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:50:41,206 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:41,209 INFO ]: Computing forward predicates... [2018-06-24 20:50:41,255 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:41,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:41,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:50:41,275 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:50:41,275 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:50:41,275 INFO ]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:50:41,275 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 21 states. [2018-06-24 20:50:41,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:41,491 INFO ]: Finished difference Result 37 states and 42 transitions. [2018-06-24 20:50:41,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:50:41,491 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-24 20:50:41,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:41,491 INFO ]: With dead ends: 37 [2018-06-24 20:50:41,491 INFO ]: Without dead ends: 37 [2018-06-24 20:50:41,492 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=557, Invalid=1003, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:50:41,492 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:50:41,493 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-06-24 20:50:41,493 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:50:41,494 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:50:41,494 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2018-06-24 20:50:41,494 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:41,494 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:50:41,494 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:50:41,494 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:50:41,494 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:50:41,494 INFO ]: Found error trace [2018-06-24 20:50:41,494 INFO ]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:41,494 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:41,494 INFO ]: Analyzing trace with hash 974249957, now seen corresponding path program 22 times [2018-06-24 20:50:41,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:41,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:41,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:41,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:41,506 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:41,693 INFO ]: Checked inductivity of 83 backedges. 36 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:41,693 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:41,693 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:41,698 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:41,740 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:41,740 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:41,743 INFO ]: Computing forward predicates... [2018-06-24 20:50:42,195 INFO ]: Checked inductivity of 83 backedges. 45 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:42,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:42,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 20:50:42,227 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:50:42,227 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:50:42,227 INFO ]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:50:42,227 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 22 states. [2018-06-24 20:50:43,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:43,034 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:50:43,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:50:43,034 INFO ]: Start accepts. Automaton has 22 states. Word has length 23 [2018-06-24 20:50:43,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:43,035 INFO ]: With dead ends: 37 [2018-06-24 20:50:43,035 INFO ]: Without dead ends: 26 [2018-06-24 20:50:43,035 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:50:43,035 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:50:43,036 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-06-24 20:50:43,036 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:50:43,037 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-24 20:50:43,037 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2018-06-24 20:50:43,037 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:43,037 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-24 20:50:43,037 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:50:43,037 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-24 20:50:43,037 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:50:43,037 INFO ]: Found error trace [2018-06-24 20:50:43,037 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:43,038 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:43,038 INFO ]: Analyzing trace with hash 1161641707, now seen corresponding path program 23 times [2018-06-24 20:50:43,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:43,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:43,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,039 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:43,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:43,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,365 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:43,365 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:43,370 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:43,417 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:50:43,417 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:43,421 INFO ]: Computing forward predicates... [2018-06-24 20:50:43,777 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:43,796 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:43,796 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-06-24 20:50:43,797 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:50:43,797 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:50:43,797 INFO ]: CoverageRelationStatistics Valid=74, Invalid=982, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:50:43,797 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 33 states. [2018-06-24 20:50:44,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:44,374 INFO ]: Finished difference Result 39 states and 44 transitions. [2018-06-24 20:50:44,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:50:44,374 INFO ]: Start accepts. Automaton has 33 states. Word has length 24 [2018-06-24 20:50:44,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:44,375 INFO ]: With dead ends: 39 [2018-06-24 20:50:44,375 INFO ]: Without dead ends: 39 [2018-06-24 20:50:44,376 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=1885, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:50:44,376 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:50:44,377 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 27. [2018-06-24 20:50:44,377 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:50:44,378 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-06-24 20:50:44,378 INFO ]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2018-06-24 20:50:44,378 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:44,378 INFO ]: Abstraction has 27 states and 30 transitions. [2018-06-24 20:50:44,378 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:50:44,378 INFO ]: Start isEmpty. Operand 27 states and 30 transitions. [2018-06-24 20:50:44,378 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:50:44,378 INFO ]: Found error trace [2018-06-24 20:50:44,379 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:44,379 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:44,379 INFO ]: Analyzing trace with hash -1619148635, now seen corresponding path program 24 times [2018-06-24 20:50:44,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:44,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:44,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:44,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:44,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,851 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:44,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:44,857 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:44,903 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:50:44,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:44,907 INFO ]: Computing forward predicates... [2018-06-24 20:50:44,967 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:44,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:44,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:50:44,987 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:50:44,987 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:50:44,987 INFO ]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:50:44,988 INFO ]: Start difference. First operand 27 states and 30 transitions. Second operand 23 states. [2018-06-24 20:50:45,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:45,274 INFO ]: Finished difference Result 40 states and 45 transitions. [2018-06-24 20:50:45,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:50:45,274 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-24 20:50:45,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:45,274 INFO ]: With dead ends: 40 [2018-06-24 20:50:45,274 INFO ]: Without dead ends: 40 [2018-06-24 20:50:45,275 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=673, Invalid=1219, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:50:45,275 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:50:45,276 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 26. [2018-06-24 20:50:45,276 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:50:45,276 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:50:45,277 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 25 [2018-06-24 20:50:45,277 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:45,277 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:50:45,277 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:50:45,277 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:50:45,277 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:50:45,277 INFO ]: Found error trace [2018-06-24 20:50:45,277 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:45,277 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:45,277 INFO ]: Analyzing trace with hash 1651015312, now seen corresponding path program 25 times [2018-06-24 20:50:45,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:45,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:45,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,279 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:45,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:45,290 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,721 INFO ]: Checked inductivity of 102 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,721 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:45,721 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:45,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:45,770 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:45,773 INFO ]: Computing forward predicates... [2018-06-24 20:50:45,878 INFO ]: Checked inductivity of 102 backedges. 55 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:45,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:45,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 20:50:45,898 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:50:45,898 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:50:45,898 INFO ]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:50:45,899 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 24 states. [2018-06-24 20:50:46,119 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:46,119 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:50:46,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:50:46,119 INFO ]: Start accepts. Automaton has 24 states. Word has length 25 [2018-06-24 20:50:46,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:46,119 INFO ]: With dead ends: 40 [2018-06-24 20:50:46,119 INFO ]: Without dead ends: 28 [2018-06-24 20:50:46,120 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:50:46,120 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:50:46,121 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-06-24 20:50:46,121 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:50:46,121 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-24 20:50:46,121 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2018-06-24 20:50:46,121 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:46,121 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-24 20:50:46,121 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:50:46,121 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-24 20:50:46,122 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:50:46,122 INFO ]: Found error trace [2018-06-24 20:50:46,122 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:46,122 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:46,122 INFO ]: Analyzing trace with hash 1345860630, now seen corresponding path program 26 times [2018-06-24 20:50:46,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:46,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:46,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:46,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:46,136 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,604 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,605 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:46,605 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:46,611 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:46,658 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:46,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:46,662 INFO ]: Computing forward predicates... [2018-06-24 20:50:46,964 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:46,983 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:46,983 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 36 [2018-06-24 20:50:46,983 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:50:46,984 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:50:46,984 INFO ]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:50:46,984 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 36 states. [2018-06-24 20:50:47,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:47,692 INFO ]: Finished difference Result 42 states and 47 transitions. [2018-06-24 20:50:47,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:50:47,693 INFO ]: Start accepts. Automaton has 36 states. Word has length 26 [2018-06-24 20:50:47,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:47,693 INFO ]: With dead ends: 42 [2018-06-24 20:50:47,693 INFO ]: Without dead ends: 42 [2018-06-24 20:50:47,694 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=2248, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:50:47,694 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 20:50:47,695 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 29. [2018-06-24 20:50:47,695 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:50:47,695 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-24 20:50:47,695 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-24 20:50:47,696 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:47,696 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-24 20:50:47,696 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:50:47,696 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-24 20:50:47,696 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:50:47,696 INFO ]: Found error trace [2018-06-24 20:50:47,696 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:47,696 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:47,696 INFO ]: Analyzing trace with hash 476000080, now seen corresponding path program 27 times [2018-06-24 20:50:47,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:47,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:47,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,697 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:47,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:47,708 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,864 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:48,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:48,864 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:48,869 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:48,927 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:50:48,927 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:48,930 INFO ]: Computing forward predicates... [2018-06-24 20:50:49,363 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:49,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:49,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:50:49,382 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:50:49,382 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:50:49,383 INFO ]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:50:49,383 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 25 states. [2018-06-24 20:50:49,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:49,850 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-24 20:50:49,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:49,850 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-24 20:50:49,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:49,850 INFO ]: With dead ends: 43 [2018-06-24 20:50:49,850 INFO ]: Without dead ends: 43 [2018-06-24 20:50:49,851 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=800, Invalid=1456, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:50:49,851 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:50:49,852 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-24 20:50:49,852 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:50:49,852 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:50:49,852 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 27 [2018-06-24 20:50:49,852 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:49,852 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:50:49,853 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:50:49,853 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:50:49,853 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:50:49,853 INFO ]: Found error trace [2018-06-24 20:50:49,853 INFO ]: trace histogram [12, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:49,853 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:49,853 INFO ]: Analyzing trace with hash -1228132667, now seen corresponding path program 28 times [2018-06-24 20:50:49,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:49,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:49,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,856 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:49,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:49,868 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,134 INFO ]: Checked inductivity of 123 backedges. 55 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:50,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:50,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:50,146 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:50,193 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:50,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:50,196 INFO ]: Computing forward predicates... [2018-06-24 20:50:50,306 INFO ]: Checked inductivity of 123 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:50,325 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:50,325 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 20:50:50,325 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:50:50,325 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:50:50,325 INFO ]: CoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:50:50,325 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-24 20:50:50,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:50,532 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-24 20:50:50,532 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:50:50,532 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-24 20:50:50,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:50,533 INFO ]: With dead ends: 43 [2018-06-24 20:50:50,533 INFO ]: Without dead ends: 30 [2018-06-24 20:50:50,533 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1184, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:50:50,533 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:50:50,534 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-06-24 20:50:50,534 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:50:50,535 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:50:50,535 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-24 20:50:50,535 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:50,535 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:50:50,535 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:50:50,535 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:50:50,535 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:50:50,535 INFO ]: Found error trace [2018-06-24 20:50:50,535 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:50,535 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:50,535 INFO ]: Analyzing trace with hash 1870961355, now seen corresponding path program 29 times [2018-06-24 20:50:50,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:50,536 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:50,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:50,536 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:50,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:50,551 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:51,751 INFO ]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:51,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:51,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:51,757 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:51,816 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:50:51,816 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:51,821 INFO ]: Computing forward predicates... [2018-06-24 20:50:52,132 INFO ]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:52,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:52,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 39 [2018-06-24 20:50:52,151 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:50:52,151 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:50:52,151 INFO ]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:50:52,152 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 39 states. [2018-06-24 20:50:52,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:52,931 INFO ]: Finished difference Result 45 states and 50 transitions. [2018-06-24 20:50:52,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:50:52,931 INFO ]: Start accepts. Automaton has 39 states. Word has length 28 [2018-06-24 20:50:52,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:52,932 INFO ]: With dead ends: 45 [2018-06-24 20:50:52,932 INFO ]: Without dead ends: 45 [2018-06-24 20:50:52,932 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=2643, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:50:52,932 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-24 20:50:52,933 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-06-24 20:50:52,933 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:50:52,934 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-24 20:50:52,934 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2018-06-24 20:50:52,934 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:52,934 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-24 20:50:52,934 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:50:52,934 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-24 20:50:52,934 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:50:52,934 INFO ]: Found error trace [2018-06-24 20:50:52,934 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:52,934 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:52,934 INFO ]: Analyzing trace with hash -841371771, now seen corresponding path program 30 times [2018-06-24 20:50:52,934 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:52,934 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:52,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:52,935 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:52,935 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:52,945 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:53,218 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:53,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:53,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:53,223 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:53,278 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:50:53,278 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:53,282 INFO ]: Computing forward predicates... [2018-06-24 20:50:53,358 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:53,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:53,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:50:53,376 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:50:53,376 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:50:53,377 INFO ]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:50:53,377 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 27 states. [2018-06-24 20:50:53,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:53,675 INFO ]: Finished difference Result 46 states and 51 transitions. [2018-06-24 20:50:53,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:50:53,675 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-24 20:50:53,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:53,676 INFO ]: With dead ends: 46 [2018-06-24 20:50:53,676 INFO ]: Without dead ends: 46 [2018-06-24 20:50:53,677 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=938, Invalid=1714, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:50:53,677 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:50:53,678 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 30. [2018-06-24 20:50:53,678 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:50:53,678 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-24 20:50:53,678 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 29 [2018-06-24 20:50:53,678 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:53,678 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-24 20:50:53,678 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:50:53,678 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-24 20:50:53,679 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:50:53,679 INFO ]: Found error trace [2018-06-24 20:50:53,679 INFO ]: trace histogram [13, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:53,679 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:53,679 INFO ]: Analyzing trace with hash -2129879376, now seen corresponding path program 31 times [2018-06-24 20:50:53,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:53,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:53,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:53,680 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:53,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:53,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:54,007 INFO ]: Checked inductivity of 146 backedges. 66 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:54,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:54,007 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:54,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:54,064 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:54,068 INFO ]: Computing forward predicates... [2018-06-24 20:50:54,100 INFO ]: Checked inductivity of 146 backedges. 78 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:54,120 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:54,120 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 20:50:54,120 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:50:54,120 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:50:54,120 INFO ]: CoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:50:54,120 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 28 states. [2018-06-24 20:50:54,569 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:54,569 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-24 20:50:54,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:50:54,569 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-24 20:50:54,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:54,570 INFO ]: With dead ends: 46 [2018-06-24 20:50:54,570 INFO ]: Without dead ends: 32 [2018-06-24 20:50:54,570 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=1374, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:50:54,570 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:50:54,571 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-06-24 20:50:54,571 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:50:54,571 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-24 20:50:54,571 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2018-06-24 20:50:54,571 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:54,571 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-24 20:50:54,571 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:50:54,571 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-24 20:50:54,571 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:50:54,571 INFO ]: Found error trace [2018-06-24 20:50:54,572 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:54,572 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:54,572 INFO ]: Analyzing trace with hash -312860362, now seen corresponding path program 32 times [2018-06-24 20:50:54,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:54,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:54,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:54,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:54,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:54,584 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:55,017 INFO ]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:55,018 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:55,018 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:55,023 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:55,076 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:55,076 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:55,081 INFO ]: Computing forward predicates... [2018-06-24 20:50:55,424 INFO ]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:55,442 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:55,442 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 42 [2018-06-24 20:50:55,442 INFO ]: Interpolant automaton has 42 states [2018-06-24 20:50:55,442 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-24 20:50:55,443 INFO ]: CoverageRelationStatistics Valid=95, Invalid=1627, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:50:55,443 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 42 states. [2018-06-24 20:50:56,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:56,032 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-24 20:50:56,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:50:56,032 INFO ]: Start accepts. Automaton has 42 states. Word has length 30 [2018-06-24 20:50:56,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:56,033 INFO ]: With dead ends: 48 [2018-06-24 20:50:56,033 INFO ]: Without dead ends: 48 [2018-06-24 20:50:56,033 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=3070, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:50:56,033 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 20:50:56,034 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-06-24 20:50:56,034 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:50:56,035 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-06-24 20:50:56,035 INFO ]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2018-06-24 20:50:56,035 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:56,035 INFO ]: Abstraction has 33 states and 36 transitions. [2018-06-24 20:50:56,035 INFO ]: Interpolant automaton has 42 states. [2018-06-24 20:50:56,035 INFO ]: Start isEmpty. Operand 33 states and 36 transitions. [2018-06-24 20:50:56,035 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:50:56,035 INFO ]: Found error trace [2018-06-24 20:50:56,035 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:56,035 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:56,036 INFO ]: Analyzing trace with hash 180154224, now seen corresponding path program 33 times [2018-06-24 20:50:56,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:56,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:56,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:56,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:56,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:56,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:56,351 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:56,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:56,351 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:56,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:56,419 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:50:56,419 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:56,423 INFO ]: Computing forward predicates... [2018-06-24 20:50:56,466 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:56,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:56,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:50:56,485 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:50:56,485 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:50:56,486 INFO ]: CoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:50:56,486 INFO ]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2018-06-24 20:50:56,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:56,864 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-24 20:50:56,864 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-24 20:50:56,864 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-24 20:50:56,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:56,865 INFO ]: With dead ends: 49 [2018-06-24 20:50:56,865 INFO ]: Without dead ends: 49 [2018-06-24 20:50:56,866 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1087, Invalid=1993, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:50:56,866 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:50:56,867 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-06-24 20:50:56,867 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:50:56,867 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:50:56,867 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 31 [2018-06-24 20:50:56,867 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:56,867 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:50:56,867 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:50:56,867 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:50:56,868 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:50:56,868 INFO ]: Found error trace [2018-06-24 20:50:56,868 INFO ]: trace histogram [14, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:56,868 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:56,868 INFO ]: Analyzing trace with hash -1108875867, now seen corresponding path program 34 times [2018-06-24 20:50:56,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:56,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:56,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:56,868 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:56,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:56,880 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:57,158 INFO ]: Checked inductivity of 171 backedges. 78 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:57,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:57,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:57,163 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:57,219 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:57,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:57,223 INFO ]: Computing forward predicates... [2018-06-24 20:50:57,256 INFO ]: Checked inductivity of 171 backedges. 91 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:57,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:57,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-24 20:50:57,276 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:50:57,276 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:50:57,276 INFO ]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:50:57,276 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 30 states. [2018-06-24 20:50:57,611 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:57,611 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:50:57,611 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:50:57,611 INFO ]: Start accepts. Automaton has 30 states. Word has length 31 [2018-06-24 20:50:57,611 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:57,611 INFO ]: With dead ends: 49 [2018-06-24 20:50:57,611 INFO ]: Without dead ends: 34 [2018-06-24 20:50:57,612 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=492, Invalid=1578, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:50:57,612 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:50:57,613 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-06-24 20:50:57,613 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:50:57,613 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-24 20:50:57,613 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2018-06-24 20:50:57,613 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:57,613 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-24 20:50:57,613 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:50:57,613 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-24 20:50:57,613 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:50:57,613 INFO ]: Found error trace [2018-06-24 20:50:57,613 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:57,613 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:57,613 INFO ]: Analyzing trace with hash 1289674411, now seen corresponding path program 35 times [2018-06-24 20:50:57,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:57,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:57,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:57,613 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:57,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:57,634 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:58,076 INFO ]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:58,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:58,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:58,088 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:58,159 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:50:58,159 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:58,164 INFO ]: Computing forward predicates... [2018-06-24 20:50:58,670 INFO ]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:58,689 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:58,689 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2018-06-24 20:50:58,689 INFO ]: Interpolant automaton has 45 states [2018-06-24 20:50:58,689 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-24 20:50:58,690 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1878, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 20:50:58,690 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 45 states. [2018-06-24 20:50:59,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:59,399 INFO ]: Finished difference Result 51 states and 56 transitions. [2018-06-24 20:50:59,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:50:59,403 INFO ]: Start accepts. Automaton has 45 states. Word has length 32 [2018-06-24 20:50:59,403 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:59,403 INFO ]: With dead ends: 51 [2018-06-24 20:50:59,403 INFO ]: Without dead ends: 51 [2018-06-24 20:50:59,404 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:50:59,404 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-24 20:50:59,405 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-06-24 20:50:59,405 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:50:59,406 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-06-24 20:50:59,406 INFO ]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2018-06-24 20:50:59,406 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:59,406 INFO ]: Abstraction has 35 states and 38 transitions. [2018-06-24 20:50:59,406 INFO ]: Interpolant automaton has 45 states. [2018-06-24 20:50:59,406 INFO ]: Start isEmpty. Operand 35 states and 38 transitions. [2018-06-24 20:50:59,406 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:50:59,406 INFO ]: Found error trace [2018-06-24 20:50:59,406 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:59,406 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:59,406 INFO ]: Analyzing trace with hash -1664678299, now seen corresponding path program 36 times [2018-06-24 20:50:59,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:59,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:59,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:59,407 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:59,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:59,416 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:00,180 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:00,180 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:00,180 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:00,186 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:00,252 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:51:00,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:00,256 INFO ]: Computing forward predicates... [2018-06-24 20:51:00,300 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:00,319 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:00,319 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 20:51:00,319 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:51:00,319 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:51:00,319 INFO ]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:51:00,320 INFO ]: Start difference. First operand 35 states and 38 transitions. Second operand 31 states. [2018-06-24 20:51:00,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:00,681 INFO ]: Finished difference Result 52 states and 57 transitions. [2018-06-24 20:51:00,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-24 20:51:00,681 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-24 20:51:00,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:00,681 INFO ]: With dead ends: 52 [2018-06-24 20:51:00,681 INFO ]: Without dead ends: 52 [2018-06-24 20:51:00,682 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1247, Invalid=2293, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:51:00,682 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:51:00,683 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 34. [2018-06-24 20:51:00,684 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:51:00,684 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:51:00,684 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 33 [2018-06-24 20:51:00,684 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:00,684 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:51:00,684 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:51:00,684 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:51:00,684 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:51:00,684 INFO ]: Found error trace [2018-06-24 20:51:00,684 INFO ]: trace histogram [15, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:00,684 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:00,684 INFO ]: Analyzing trace with hash 1325061840, now seen corresponding path program 37 times [2018-06-24 20:51:00,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:00,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:00,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:00,685 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:00,685 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:00,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:00,991 INFO ]: Checked inductivity of 198 backedges. 91 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:00,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:00,991 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:00,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:01,055 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:01,060 INFO ]: Computing forward predicates... [2018-06-24 20:51:01,411 INFO ]: Checked inductivity of 198 backedges. 105 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:01,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:01,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 20:51:01,430 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:51:01,431 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:51:01,431 INFO ]: CoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:51:01,431 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 32 states. [2018-06-24 20:51:01,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:01,764 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-24 20:51:01,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:51:01,764 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-24 20:51:01,764 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:01,764 INFO ]: With dead ends: 52 [2018-06-24 20:51:01,764 INFO ]: Without dead ends: 36 [2018-06-24 20:51:01,764 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=556, Invalid=1796, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:51:01,764 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:51:01,765 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-06-24 20:51:01,765 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:51:01,766 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-24 20:51:01,766 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-24 20:51:01,766 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:01,766 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-24 20:51:01,766 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:51:01,766 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-24 20:51:01,766 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:51:01,766 INFO ]: Found error trace [2018-06-24 20:51:01,766 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:01,766 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:01,766 INFO ]: Analyzing trace with hash -65558954, now seen corresponding path program 38 times [2018-06-24 20:51:01,766 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:01,766 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:01,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:01,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:01,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:01,783 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:02,301 INFO ]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:02,301 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:02,301 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:02,306 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:02,367 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:02,367 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:02,376 INFO ]: Computing forward predicates... [2018-06-24 20:51:03,165 INFO ]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:03,184 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:03,186 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 48 [2018-06-24 20:51:03,186 INFO ]: Interpolant automaton has 48 states [2018-06-24 20:51:03,187 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 20:51:03,187 INFO ]: CoverageRelationStatistics Valid=109, Invalid=2147, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:51:03,187 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 48 states. [2018-06-24 20:51:04,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:04,063 INFO ]: Finished difference Result 54 states and 59 transitions. [2018-06-24 20:51:04,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:51:04,063 INFO ]: Start accepts. Automaton has 48 states. Word has length 34 [2018-06-24 20:51:04,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:04,064 INFO ]: With dead ends: 54 [2018-06-24 20:51:04,064 INFO ]: Without dead ends: 54 [2018-06-24 20:51:04,064 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=270, Invalid=4020, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:51:04,064 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-24 20:51:04,066 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 37. [2018-06-24 20:51:04,066 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:04,066 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-24 20:51:04,066 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-06-24 20:51:04,066 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:04,066 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-24 20:51:04,066 INFO ]: Interpolant automaton has 48 states. [2018-06-24 20:51:04,066 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-24 20:51:04,066 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:51:04,066 INFO ]: Found error trace [2018-06-24 20:51:04,066 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:04,066 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:04,067 INFO ]: Analyzing trace with hash -225130608, now seen corresponding path program 39 times [2018-06-24 20:51:04,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:04,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:04,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,068 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:04,068 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,081 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:04,384 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:04,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:04,384 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:04,392 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:04,472 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:51:04,472 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:04,477 INFO ]: Computing forward predicates... [2018-06-24 20:51:04,514 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:04,533 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:04,533 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:51:04,533 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:51:04,534 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:51:04,534 INFO ]: CoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:51:04,534 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 33 states. [2018-06-24 20:51:04,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:04,964 INFO ]: Finished difference Result 55 states and 60 transitions. [2018-06-24 20:51:04,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-24 20:51:04,964 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-24 20:51:04,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:04,964 INFO ]: With dead ends: 55 [2018-06-24 20:51:04,965 INFO ]: Without dead ends: 55 [2018-06-24 20:51:04,965 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1418, Invalid=2614, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 20:51:04,965 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:51:04,966 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-06-24 20:51:04,966 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:51:04,967 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-24 20:51:04,967 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 35 [2018-06-24 20:51:04,967 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:04,967 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-24 20:51:04,967 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:51:04,967 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-24 20:51:04,967 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:51:04,967 INFO ]: Found error trace [2018-06-24 20:51:04,967 INFO ]: trace histogram [16, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:04,967 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:04,967 INFO ]: Analyzing trace with hash -2032466811, now seen corresponding path program 40 times [2018-06-24 20:51:04,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:04,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:04,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,968 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:04,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:04,976 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:05,390 INFO ]: Checked inductivity of 227 backedges. 105 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:05,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:05,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:05,395 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:51:05,465 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:51:05,465 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:05,471 INFO ]: Computing forward predicates... [2018-06-24 20:51:06,024 INFO ]: Checked inductivity of 227 backedges. 120 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:06,043 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:06,043 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-24 20:51:06,043 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:51:06,043 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:51:06,043 INFO ]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:51:06,043 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 34 states. [2018-06-24 20:51:06,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:06,437 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-24 20:51:06,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:51:06,437 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-24 20:51:06,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:06,438 INFO ]: With dead ends: 55 [2018-06-24 20:51:06,438 INFO ]: Without dead ends: 38 [2018-06-24 20:51:06,438 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=624, Invalid=2028, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:51:06,438 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:51:06,439 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-06-24 20:51:06,439 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:51:06,439 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-24 20:51:06,439 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 35 [2018-06-24 20:51:06,439 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:06,439 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-24 20:51:06,439 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:51:06,439 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-24 20:51:06,439 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:51:06,439 INFO ]: Found error trace [2018-06-24 20:51:06,439 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:06,440 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:06,440 INFO ]: Analyzing trace with hash 1610746507, now seen corresponding path program 41 times [2018-06-24 20:51:06,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:06,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:06,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:06,440 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:06,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:06,451 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:07,545 INFO ]: Checked inductivity of 241 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:07,545 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:07,545 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:07,550 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:51:07,627 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:51:07,627 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:07,633 INFO ]: Computing forward predicates... [2018-06-24 20:51:08,220 INFO ]: Checked inductivity of 241 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:08,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:08,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 51 [2018-06-24 20:51:08,253 INFO ]: Interpolant automaton has 51 states [2018-06-24 20:51:08,253 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-24 20:51:08,253 INFO ]: CoverageRelationStatistics Valid=116, Invalid=2434, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:51:08,254 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 51 states. [2018-06-24 20:51:09,242 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:09,242 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-24 20:51:09,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:51:09,242 INFO ]: Start accepts. Automaton has 51 states. Word has length 36 [2018-06-24 20:51:09,242 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:09,242 INFO ]: With dead ends: 57 [2018-06-24 20:51:09,242 INFO ]: Without dead ends: 57 [2018-06-24 20:51:09,243 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=287, Invalid=4543, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 20:51:09,243 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 20:51:09,244 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 39. [2018-06-24 20:51:09,244 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:51:09,244 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-06-24 20:51:09,244 INFO ]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-06-24 20:51:09,244 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:09,244 INFO ]: Abstraction has 39 states and 42 transitions. [2018-06-24 20:51:09,244 INFO ]: Interpolant automaton has 51 states. [2018-06-24 20:51:09,244 INFO ]: Start isEmpty. Operand 39 states and 42 transitions. [2018-06-24 20:51:09,245 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:51:09,245 INFO ]: Found error trace [2018-06-24 20:51:09,245 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:09,245 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:09,245 INFO ]: Analyzing trace with hash -1413757627, now seen corresponding path program 42 times [2018-06-24 20:51:09,245 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:09,245 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:09,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:09,245 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:09,245 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:09,261 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:09,694 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:09,694 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:09,694 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:09,699 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:51:09,776 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:51:09,776 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:09,782 INFO ]: Computing forward predicates... [2018-06-24 20:51:09,817 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:09,836 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:09,836 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:51:09,837 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:51:09,837 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:51:09,837 INFO ]: CoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:51:09,837 INFO ]: Start difference. First operand 39 states and 42 transitions. Second operand 35 states. [2018-06-24 20:51:10,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:10,440 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-24 20:51:10,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-24 20:51:10,440 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-24 20:51:10,440 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:10,440 INFO ]: With dead ends: 58 [2018-06-24 20:51:10,440 INFO ]: Without dead ends: 58 [2018-06-24 20:51:10,441 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1600, Invalid=2956, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 20:51:10,441 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:51:10,442 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-06-24 20:51:10,442 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:51:10,443 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:51:10,443 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 37 [2018-06-24 20:51:10,443 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:10,443 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:51:10,443 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:51:10,443 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:51:10,443 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:51:10,443 INFO ]: Found error trace [2018-06-24 20:51:10,443 INFO ]: trace histogram [17, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:10,443 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:10,443 INFO ]: Analyzing trace with hash -1606605072, now seen corresponding path program 43 times [2018-06-24 20:51:10,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:10,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:10,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:10,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:10,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:10,461 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:10,829 INFO ]: Checked inductivity of 258 backedges. 120 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:10,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:10,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:10,836 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:10,914 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:10,922 INFO ]: Computing forward predicates... [2018-06-24 20:51:11,573 INFO ]: Checked inductivity of 258 backedges. 136 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:11,604 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:11,604 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 20:51:11,604 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:51:11,605 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:51:11,605 INFO ]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:51:11,605 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 36 states. [2018-06-24 20:51:13,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:13,098 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-24 20:51:13,098 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:51:13,098 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-24 20:51:13,098 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:13,098 INFO ]: With dead ends: 58 [2018-06-24 20:51:13,098 INFO ]: Without dead ends: 40 [2018-06-24 20:51:13,098 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=696, Invalid=2274, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:51:13,098 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:51:13,099 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-06-24 20:51:13,099 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:51:13,100 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-24 20:51:13,100 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2018-06-24 20:51:13,100 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:13,100 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-24 20:51:13,100 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:51:13,100 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-24 20:51:13,100 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:51:13,100 INFO ]: Found error trace [2018-06-24 20:51:13,100 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:13,100 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:13,100 INFO ]: Analyzing trace with hash -876952714, now seen corresponding path program 44 times [2018-06-24 20:51:13,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:13,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:13,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:13,101 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:51:13,101 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:13,119 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:13,926 INFO ]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:13,926 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:13,926 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:13,932 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:51:14,003 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:51:14,003 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:14,009 INFO ]: Computing forward predicates... [2018-06-24 20:51:14,621 INFO ]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:14,641 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:14,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 54 [2018-06-24 20:51:14,641 INFO ]: Interpolant automaton has 54 states [2018-06-24 20:51:14,641 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-24 20:51:14,641 INFO ]: CoverageRelationStatistics Valid=123, Invalid=2739, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:51:14,642 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 54 states. [2018-06-24 20:51:15,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:15,615 INFO ]: Finished difference Result 60 states and 65 transitions. [2018-06-24 20:51:15,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:51:15,615 INFO ]: Start accepts. Automaton has 54 states. Word has length 38 [2018-06-24 20:51:15,615 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:15,615 INFO ]: With dead ends: 60 [2018-06-24 20:51:15,615 INFO ]: Without dead ends: 60 [2018-06-24 20:51:15,616 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=304, Invalid=5098, Unknown=0, NotChecked=0, Total=5402 [2018-06-24 20:51:15,616 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-24 20:51:15,617 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 41. [2018-06-24 20:51:15,617 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:51:15,618 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-24 20:51:15,618 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-24 20:51:15,618 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:15,618 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-24 20:51:15,618 INFO ]: Interpolant automaton has 54 states. [2018-06-24 20:51:15,618 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-24 20:51:15,618 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:51:15,618 INFO ]: Found error trace [2018-06-24 20:51:15,618 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:15,618 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:15,618 INFO ]: Analyzing trace with hash 267433904, now seen corresponding path program 45 times [2018-06-24 20:51:15,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:15,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:15,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:15,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:15,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:15,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:16,458 INFO ]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:16,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:51:16,458 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:51:16,464 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:51:16,545 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:51:16,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:51:16,551 INFO ]: Computing forward predicates... [2018-06-24 20:51:16,654 INFO ]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:51:16,673 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:51:16,673 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 20:51:16,673 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:51:16,673 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:51:16,673 INFO ]: CoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:51:16,673 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 37 states. [2018-06-24 20:51:17,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:51:17,338 INFO ]: Finished difference Result 61 states and 66 transitions. [2018-06-24 20:51:17,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-06-24 20:51:17,339 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-24 20:51:17,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:51:17,339 INFO ]: With dead ends: 61 [2018-06-24 20:51:17,339 INFO ]: Without dead ends: 61 [2018-06-24 20:51:17,340 INFO ]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1793, Invalid=3319, Unknown=0, NotChecked=0, Total=5112 [2018-06-24 20:51:17,340 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:51:17,341 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-06-24 20:51:17,341 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:51:17,341 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-24 20:51:17,341 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 39 [2018-06-24 20:51:17,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:51:17,341 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-24 20:51:17,341 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:51:17,341 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-24 20:51:17,341 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:51:17,341 INFO ]: Found error trace [2018-06-24 20:51:17,341 INFO ]: trace histogram [18, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:51:17,341 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:51:17,341 INFO ]: Analyzing trace with hash -1415869595, now seen corresponding path program 46 times [2018-06-24 20:51:17,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:51:17,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:51:17,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:17,342 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:51:17,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:51:17,356 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 20:51:17,595 WARN ]: Verification canceled [2018-06-24 20:51:17,597 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:51:17,599 WARN ]: Timeout [2018-06-24 20:51:17,599 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:51:17 BasicIcfg [2018-06-24 20:51:17,599 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:51:17,600 INFO ]: Toolchain (without parser) took 55598.35 ms. Allocated memory was 305.7 MB in the beginning and 829.4 MB in the end (delta: 523.8 MB). Free memory was 261.0 MB in the beginning and 622.4 MB in the end (delta: -361.4 MB). Peak memory consumption was 162.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,602 INFO ]: SmtParser took 0.32 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:51:17,602 INFO ]: ChcToBoogie took 63.87 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 258.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,602 INFO ]: Boogie Preprocessor took 45.03 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,602 INFO ]: RCFGBuilder took 381.81 ms. Allocated memory is still 305.7 MB. Free memory was 257.1 MB in the beginning and 247.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,604 INFO ]: BlockEncodingV2 took 186.39 ms. Allocated memory is still 305.7 MB. Free memory was 247.1 MB in the beginning and 241.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,604 INFO ]: TraceAbstraction took 54912.59 ms. Allocated memory was 305.7 MB in the beginning and 829.4 MB in the end (delta: 523.8 MB). Free memory was 240.1 MB in the beginning and 622.4 MB in the end (delta: -382.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 3.6 GB. [2018-06-24 20:51:17,606 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 19 edges - StatisticsResult: Encoded RCFG 7 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.32 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 63.87 ms. Allocated memory is still 305.7 MB. Free memory was 261.0 MB in the beginning and 258.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 45.03 ms. Allocated memory is still 305.7 MB. Free memory was 258.1 MB in the beginning and 257.1 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 381.81 ms. Allocated memory is still 305.7 MB. Free memory was 257.1 MB in the beginning and 247.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 186.39 ms. Allocated memory is still 305.7 MB. Free memory was 247.1 MB in the beginning and 241.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54912.59 ms. Allocated memory was 305.7 MB in the beginning and 829.4 MB in the end (delta: 523.8 MB). Free memory was 240.1 MB in the beginning and 622.4 MB in the end (delta: -382.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 18, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 38 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 54.8s OverallTime, 55 OverallIterations, 18 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 483 SDtfs, 588 SDslu, 3986 SDs, 0 SdLazy, 13690 SolverSat, 2658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2788 GetRequests, 962 SyntacticMatches, 17 SemanticMatches, 1809 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12993 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=53, 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, 54 MinimizatonAttempts, 420 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 2263 NumberOfCodeBlocks, 2263 NumberOfCodeBlocksAsserted, 231 NumberOfCheckSat, 2158 ConstructedInterpolants, 0 QuantifiedInterpolants, 278607 SizeOfPredicates, 1318 NumberOfNonLiveVariables, 20773 ConjunctsInSsa, 5207 ConjunctsInUnsatCore, 105 InterpolantComputations, 4 PerfectInterpolantSequences, 3130/9927 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/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-51-17-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-51-17-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-51-17-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop3_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-51-17-620.csv Completed graceful shutdown