java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/twisted_counters.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:12:48,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:12:48,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:12:48,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:12:48,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:12:48,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:12:48,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:12:48,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:12:48,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:12:48,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:12:48,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:12:48,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:12:48,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:12:48,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:12:48,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:12:48,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:12:48,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:12:48,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:12:48,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:12:48,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:12:48,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:12:48,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:12:48,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:12:48,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:12:48,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:12:48,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:12:48,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:12:48,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:12:48,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:12:48,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:12:48,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:12:48,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:12:48,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:12:48,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:12:48,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:12:48,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:12:48,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:12:48,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:12:48,900 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:12:48,900 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:12:48,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:12:48,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:12:48,902 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:12:48,902 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:12:48,902 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:12:48,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:12:48,903 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:12:48,903 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:12:48,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:12:48,903 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:12:48,903 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:12:48,904 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:12:48,904 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:12:48,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:12:48,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:12:48,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:12:48,905 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:12:48,906 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:12:48,906 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:12:48,960 INFO ]: Repository-Root is: /tmp [2018-06-25 08:12:48,976 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:12:48,981 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:12:48,983 INFO ]: Initializing SmtParser... [2018-06-25 08:12:48,983 INFO ]: SmtParser initialized [2018-06-25 08:12:48,984 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/twisted_counters.smt2 [2018-06-25 08:12:48,985 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-25 08:12:49,075 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/twisted_counters.smt2 unknown [2018-06-25 08:12:49,292 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/twisted_counters.smt2 [2018-06-25 08:12:49,297 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:12:49,304 INFO ]: Walking toolchain with 5 elements. [2018-06-25 08:12:49,304 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:12:49,304 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:12:49,304 INFO ]: ChcToBoogie initialized [2018-06-25 08:12:49,307 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,363 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49 Unit [2018-06-25 08:12:49,363 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:12:49,364 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:12:49,364 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:12:49,364 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:12:49,386 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,386 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,397 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,397 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,401 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,403 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,404 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,406 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:12:49,406 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:12:49,406 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:12:49,406 INFO ]: RCFGBuilder initialized [2018-06-25 08:12:49,407 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:12:49,433 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:12:49,433 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:12:49,433 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:12:49,433 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:12:49,433 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:12:49,433 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 08:12:49,692 INFO ]: Using library mode [2018-06-25 08:12:49,692 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:12:49 BoogieIcfgContainer [2018-06-25 08:12:49,692 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:12:49,693 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 08:12:49,693 INFO ]: Initializing BlockEncodingV2... [2018-06-25 08:12:49,694 INFO ]: BlockEncodingV2 initialized [2018-06-25 08:12:49,694 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:12:49" (1/1) ... [2018-06-25 08:12:49,719 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 08:12:49,721 INFO ]: Using Remove infeasible edges [2018-06-25 08:12:49,721 INFO ]: Using Maximize final states [2018-06-25 08:12:49,722 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 08:12:49,727 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 08:12:49,729 INFO ]: Using Remove sink states [2018-06-25 08:12:49,729 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 08:12:49,729 INFO ]: Using Use SBE [2018-06-25 08:12:49,736 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 08:12:51,897 WARN ]: aborting because of expected exponential blowup for input size 37 [2018-06-25 08:12:51,899 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:12:52,532 WARN ]: aborting because of expected exponential blowup for input size 37 [2018-06-25 08:12:52,534 INFO ]: SBE split 2 edges [2018-06-25 08:12:52,549 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 08:12:52,552 INFO ]: 0 new accepting states [2018-06-25 08:13:02,145 INFO ]: Removed 2054 edges and 2 locations by large block encoding [2018-06-25 08:13:02,147 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 08:13:02,155 INFO ]: Removed 2 edges and 0 locations because of local infeasibility [2018-06-25 08:13:02,156 INFO ]: 0 new accepting states [2018-06-25 08:13:02,157 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 08:13:02,157 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 08:13:02,163 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 08:13:02,165 INFO ]: 0 new accepting states [2018-06-25 08:13:02,167 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 08:13:02,167 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 08:13:02,174 INFO ]: Encoded RCFG 6 locations, 2054 edges [2018-06-25 08:13:02,175 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 08:13:02 BasicIcfg [2018-06-25 08:13:02,175 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 08:13:02,178 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:13:02,178 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:13:02,622 INFO ]: TraceAbstraction initialized [2018-06-25 08:13:02,623 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:12:49" (1/4) ... [2018-06-25 08:13:02,719 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8eec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:13:02, skipping insertion in model container [2018-06-25 08:13:02,720 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:12:49" (2/4) ... [2018-06-25 08:13:02,720 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8eec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:13:02, skipping insertion in model container [2018-06-25 08:13:02,720 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:12:49" (3/4) ... [2018-06-25 08:13:02,720 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e8eec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:13:02, skipping insertion in model container [2018-06-25 08:13:02,720 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 08:13:02" (4/4) ... [2018-06-25 08:13:02,721 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 08:13:02,872 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:13:02,952 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:13:03,267 INFO ]: Using default assertion order modulation [2018-06-25 08:13:03,268 INFO ]: Interprodecural is true [2018-06-25 08:13:03,268 INFO ]: Hoare is false [2018-06-25 08:13:03,268 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:13:03,268 INFO ]: Backedges is TWOTRACK [2018-06-25 08:13:03,268 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:13:03,268 INFO ]: Difference is false [2018-06-25 08:13:03,268 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:13:03,268 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:13:03,302 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 08:13:03,326 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 08:13:03,326 INFO ]: Found error trace [2018-06-25 08:13:03,349 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 08:13:03,349 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:03,355 INFO ]: Analyzing trace with hash 161067727, now seen corresponding path program 1 times [2018-06-25 08:13:03,357 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:03,357 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:03,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:03,417 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:03,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:03,570 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:03,767 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-06-25 08:13:03,770 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:03,773 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:03,773 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:03,775 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:03,791 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:03,792 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:03,818 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 08:13:07,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:07,221 INFO ]: Finished difference Result 7 states and 2055 transitions. [2018-06-25 08:13:07,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:07,222 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 08:13:07,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:07,256 INFO ]: With dead ends: 7 [2018-06-25 08:13:07,256 INFO ]: Without dead ends: 7 [2018-06-25 08:13:07,258 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:07,337 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:07,419 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:07,420 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:07,425 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2055 transitions. [2018-06-25 08:13:07,427 INFO ]: Start accepts. Automaton has 7 states and 2055 transitions. Word has length 5 [2018-06-25 08:13:07,427 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:07,427 INFO ]: Abstraction has 7 states and 2055 transitions. [2018-06-25 08:13:07,427 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:07,428 INFO ]: Start isEmpty. Operand 7 states and 2055 transitions. [2018-06-25 08:13:07,429 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 08:13:07,429 INFO ]: Found error trace [2018-06-25 08:13:07,429 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 08:13:07,429 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:07,429 INFO ]: Analyzing trace with hash 161127309, now seen corresponding path program 1 times [2018-06-25 08:13:07,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:07,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:07,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:07,430 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:07,430 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:07,440 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:07,481 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:07,481 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:07,481 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:07,482 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:07,482 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:07,482 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:07,482 INFO ]: Start difference. First operand 7 states and 2055 transitions. Second operand 3 states. [2018-06-25 08:13:09,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:09,725 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 08:13:09,725 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:09,725 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 08:13:09,725 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:09,727 INFO ]: With dead ends: 8 [2018-06-25 08:13:09,727 INFO ]: Without dead ends: 8 [2018-06-25 08:13:09,728 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-25 08:13:09,728 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 08:13:09,741 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 08:13:09,741 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:09,744 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2055 transitions. [2018-06-25 08:13:09,744 INFO ]: Start accepts. Automaton has 7 states and 2055 transitions. Word has length 5 [2018-06-25 08:13:09,744 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:09,744 INFO ]: Abstraction has 7 states and 2055 transitions. [2018-06-25 08:13:09,744 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:09,745 INFO ]: Start isEmpty. Operand 7 states and 2055 transitions. [2018-06-25 08:13:09,746 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:09,746 INFO ]: Found error trace [2018-06-25 08:13:09,746 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:09,746 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:09,747 INFO ]: Analyzing trace with hash 579662242, now seen corresponding path program 1 times [2018-06-25 08:13:09,747 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:09,747 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:09,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:09,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:09,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:09,780 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:09,862 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:09,862 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:09,862 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:09,862 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:09,862 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:09,862 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:09,863 INFO ]: Start difference. First operand 7 states and 2055 transitions. Second operand 3 states. [2018-06-25 08:13:12,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:12,503 INFO ]: Finished difference Result 8 states and 2055 transitions. [2018-06-25 08:13:12,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:12,503 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:12,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:12,506 INFO ]: With dead ends: 8 [2018-06-25 08:13:12,506 INFO ]: Without dead ends: 7 [2018-06-25 08:13:12,506 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-25 08:13:12,506 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:12,516 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:12,516 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:12,518 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1543 transitions. [2018-06-25 08:13:12,519 INFO ]: Start accepts. Automaton has 7 states and 1543 transitions. Word has length 6 [2018-06-25 08:13:12,519 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:12,520 INFO ]: Abstraction has 7 states and 1543 transitions. [2018-06-25 08:13:12,520 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:12,520 INFO ]: Start isEmpty. Operand 7 states and 1543 transitions. [2018-06-25 08:13:12,521 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:12,521 INFO ]: Found error trace [2018-06-25 08:13:12,521 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:12,521 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:12,521 INFO ]: Analyzing trace with hash 583356326, now seen corresponding path program 1 times [2018-06-25 08:13:12,521 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:12,521 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:12,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:12,522 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:12,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:12,557 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:12,691 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:12,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:12,692 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:12,692 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:12,692 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:12,692 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:12,692 INFO ]: Start difference. First operand 7 states and 1543 transitions. Second operand 3 states. [2018-06-25 08:13:14,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:14,121 INFO ]: Finished difference Result 8 states and 1543 transitions. [2018-06-25 08:13:14,122 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:14,122 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:14,122 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:14,123 INFO ]: With dead ends: 8 [2018-06-25 08:13:14,123 INFO ]: Without dead ends: 7 [2018-06-25 08:13:14,124 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-25 08:13:14,124 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:14,130 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:14,130 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:14,132 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1159 transitions. [2018-06-25 08:13:14,132 INFO ]: Start accepts. Automaton has 7 states and 1159 transitions. Word has length 6 [2018-06-25 08:13:14,132 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:14,132 INFO ]: Abstraction has 7 states and 1159 transitions. [2018-06-25 08:13:14,132 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:14,132 INFO ]: Start isEmpty. Operand 7 states and 1159 transitions. [2018-06-25 08:13:14,133 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:14,133 INFO ]: Found error trace [2018-06-25 08:13:14,133 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:14,133 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:14,133 INFO ]: Analyzing trace with hash 588897452, now seen corresponding path program 1 times [2018-06-25 08:13:14,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:14,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:14,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:14,134 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:14,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:14,160 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:14,233 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:14,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:14,233 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:14,234 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:14,234 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:14,234 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:14,234 INFO ]: Start difference. First operand 7 states and 1159 transitions. Second operand 3 states. [2018-06-25 08:13:15,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:15,144 INFO ]: Finished difference Result 8 states and 1159 transitions. [2018-06-25 08:13:15,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:15,165 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:15,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:15,166 INFO ]: With dead ends: 8 [2018-06-25 08:13:15,166 INFO ]: Without dead ends: 7 [2018-06-25 08:13:15,166 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-25 08:13:15,166 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:15,171 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:15,171 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:15,172 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 967 transitions. [2018-06-25 08:13:15,172 INFO ]: Start accepts. Automaton has 7 states and 967 transitions. Word has length 6 [2018-06-25 08:13:15,173 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:15,173 INFO ]: Abstraction has 7 states and 967 transitions. [2018-06-25 08:13:15,173 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:15,173 INFO ]: Start isEmpty. Operand 7 states and 967 transitions. [2018-06-25 08:13:15,173 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:15,173 INFO ]: Found error trace [2018-06-25 08:13:15,173 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:15,173 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:15,173 INFO ]: Analyzing trace with hash 589820973, now seen corresponding path program 1 times [2018-06-25 08:13:15,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:15,174 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:15,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:15,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:15,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:15,199 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:15,223 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:15,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:15,223 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:15,223 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:15,223 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:15,223 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:15,223 INFO ]: Start difference. First operand 7 states and 967 transitions. Second operand 3 states. [2018-06-25 08:13:15,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:15,931 INFO ]: Finished difference Result 8 states and 967 transitions. [2018-06-25 08:13:15,931 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:15,931 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:15,931 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:15,932 INFO ]: With dead ends: 8 [2018-06-25 08:13:15,932 INFO ]: Without dead ends: 7 [2018-06-25 08:13:15,932 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-25 08:13:15,932 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:15,935 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:15,935 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:15,937 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2018-06-25 08:13:15,937 INFO ]: Start accepts. Automaton has 7 states and 679 transitions. Word has length 6 [2018-06-25 08:13:15,938 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:15,938 INFO ]: Abstraction has 7 states and 679 transitions. [2018-06-25 08:13:15,938 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:15,938 INFO ]: Start isEmpty. Operand 7 states and 679 transitions. [2018-06-25 08:13:15,938 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:15,938 INFO ]: Found error trace [2018-06-25 08:13:15,938 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:15,938 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:15,939 INFO ]: Analyzing trace with hash -366023262, now seen corresponding path program 1 times [2018-06-25 08:13:15,939 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:15,939 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:15,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:15,939 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:15,939 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:15,952 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:15,981 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:15,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:15,983 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:15,983 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:15,983 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:15,983 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:15,983 INFO ]: Start difference. First operand 7 states and 679 transitions. Second operand 3 states. [2018-06-25 08:13:16,482 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:16,482 INFO ]: Finished difference Result 8 states and 679 transitions. [2018-06-25 08:13:16,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:16,487 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:16,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:16,488 INFO ]: With dead ends: 8 [2018-06-25 08:13:16,488 INFO ]: Without dead ends: 7 [2018-06-25 08:13:16,488 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-25 08:13:16,488 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:16,490 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:16,490 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:16,491 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 535 transitions. [2018-06-25 08:13:16,491 INFO ]: Start accepts. Automaton has 7 states and 535 transitions. Word has length 6 [2018-06-25 08:13:16,492 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:16,492 INFO ]: Abstraction has 7 states and 535 transitions. [2018-06-25 08:13:16,492 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:16,492 INFO ]: Start isEmpty. Operand 7 states and 535 transitions. [2018-06-25 08:13:16,492 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:16,492 INFO ]: Found error trace [2018-06-25 08:13:16,492 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:16,492 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:16,492 INFO ]: Analyzing trace with hash -364176220, now seen corresponding path program 1 times [2018-06-25 08:13:16,492 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:16,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:16,493 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:16,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:16,500 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:16,572 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:16,573 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:16,573 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:16,573 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:16,573 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:16,573 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:16,573 INFO ]: Start difference. First operand 7 states and 535 transitions. Second operand 3 states. [2018-06-25 08:13:16,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:16,959 INFO ]: Finished difference Result 8 states and 535 transitions. [2018-06-25 08:13:16,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:16,959 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:16,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:16,959 INFO ]: With dead ends: 8 [2018-06-25 08:13:16,959 INFO ]: Without dead ends: 7 [2018-06-25 08:13:16,959 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-25 08:13:16,960 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:16,961 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:16,961 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:16,962 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 343 transitions. [2018-06-25 08:13:16,962 INFO ]: Start accepts. Automaton has 7 states and 343 transitions. Word has length 6 [2018-06-25 08:13:16,962 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:16,962 INFO ]: Abstraction has 7 states and 343 transitions. [2018-06-25 08:13:16,962 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:16,962 INFO ]: Start isEmpty. Operand 7 states and 343 transitions. [2018-06-25 08:13:16,962 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:16,962 INFO ]: Found error trace [2018-06-25 08:13:16,962 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:16,962 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:16,963 INFO ]: Analyzing trace with hash -837942493, now seen corresponding path program 1 times [2018-06-25 08:13:16,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:16,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:16,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:16,963 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:16,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:16,979 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:17,083 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:17,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:17,084 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:17,084 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:17,084 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:17,084 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:17,084 INFO ]: Start difference. First operand 7 states and 343 transitions. Second operand 3 states. [2018-06-25 08:13:17,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:17,380 INFO ]: Finished difference Result 8 states and 343 transitions. [2018-06-25 08:13:17,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:17,381 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:17,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:17,381 INFO ]: With dead ends: 8 [2018-06-25 08:13:17,381 INFO ]: Without dead ends: 7 [2018-06-25 08:13:17,381 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-25 08:13:17,381 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:17,382 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:17,382 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:17,383 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2018-06-25 08:13:17,383 INFO ]: Start accepts. Automaton has 7 states and 247 transitions. Word has length 6 [2018-06-25 08:13:17,383 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:17,383 INFO ]: Abstraction has 7 states and 247 transitions. [2018-06-25 08:13:17,383 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:17,383 INFO ]: Start isEmpty. Operand 7 states and 247 transitions. [2018-06-25 08:13:17,383 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:17,383 INFO ]: Found error trace [2018-06-25 08:13:17,383 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:17,383 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:17,384 INFO ]: Analyzing trace with hash -358635094, now seen corresponding path program 1 times [2018-06-25 08:13:17,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:17,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:17,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:17,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:17,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:17,395 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:17,536 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:17,537 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:17,537 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:17,537 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:17,537 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:17,537 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:17,537 INFO ]: Start difference. First operand 7 states and 247 transitions. Second operand 3 states. [2018-06-25 08:13:17,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:17,740 INFO ]: Finished difference Result 8 states and 247 transitions. [2018-06-25 08:13:17,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:17,742 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:17,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:17,742 INFO ]: With dead ends: 8 [2018-06-25 08:13:17,742 INFO ]: Without dead ends: 7 [2018-06-25 08:13:17,742 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:17,743 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:17,744 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:17,744 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:17,744 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2018-06-25 08:13:17,744 INFO ]: Start accepts. Automaton has 7 states and 223 transitions. Word has length 6 [2018-06-25 08:13:17,744 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:17,744 INFO ]: Abstraction has 7 states and 223 transitions. [2018-06-25 08:13:17,744 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:17,744 INFO ]: Start isEmpty. Operand 7 states and 223 transitions. [2018-06-25 08:13:17,744 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:17,745 INFO ]: Found error trace [2018-06-25 08:13:17,745 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:17,745 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:17,745 INFO ]: Analyzing trace with hash -357711573, now seen corresponding path program 1 times [2018-06-25 08:13:17,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:17,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:17,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:17,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:17,745 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:17,753 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:17,829 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:17,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:17,829 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:17,830 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:17,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:17,830 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:17,830 INFO ]: Start difference. First operand 7 states and 223 transitions. Second operand 3 states. [2018-06-25 08:13:18,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:18,044 INFO ]: Finished difference Result 8 states and 223 transitions. [2018-06-25 08:13:18,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:18,045 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:18,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:18,045 INFO ]: With dead ends: 8 [2018-06-25 08:13:18,045 INFO ]: Without dead ends: 7 [2018-06-25 08:13:18,045 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-25 08:13:18,045 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:18,046 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:18,046 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:18,047 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2018-06-25 08:13:18,047 INFO ]: Start accepts. Automaton has 7 states and 127 transitions. Word has length 6 [2018-06-25 08:13:18,047 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:18,047 INFO ]: Abstraction has 7 states and 127 transitions. [2018-06-25 08:13:18,047 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:18,047 INFO ]: Start isEmpty. Operand 7 states and 127 transitions. [2018-06-25 08:13:18,047 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:18,047 INFO ]: Found error trace [2018-06-25 08:13:18,047 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:18,047 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:18,047 INFO ]: Analyzing trace with hash -602444638, now seen corresponding path program 1 times [2018-06-25 08:13:18,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:18,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:18,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:18,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:18,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:18,052 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:18,093 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:18,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:18,094 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:18,094 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:18,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:18,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:18,094 INFO ]: Start difference. First operand 7 states and 127 transitions. Second operand 3 states. [2018-06-25 08:13:18,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:18,218 INFO ]: Finished difference Result 8 states and 127 transitions. [2018-06-25 08:13:18,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:18,218 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:18,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:18,218 INFO ]: With dead ends: 8 [2018-06-25 08:13:18,218 INFO ]: Without dead ends: 7 [2018-06-25 08:13:18,219 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-25 08:13:18,219 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:18,219 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:18,219 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:18,219 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-06-25 08:13:18,220 INFO ]: Start accepts. Automaton has 7 states and 91 transitions. Word has length 6 [2018-06-25 08:13:18,220 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:18,220 INFO ]: Abstraction has 7 states and 91 transitions. [2018-06-25 08:13:18,220 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:18,220 INFO ]: Start isEmpty. Operand 7 states and 91 transitions. [2018-06-25 08:13:18,220 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:18,220 INFO ]: Found error trace [2018-06-25 08:13:18,220 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:18,220 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:18,220 INFO ]: Analyzing trace with hash -1193498078, now seen corresponding path program 1 times [2018-06-25 08:13:18,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:18,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:18,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:18,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:18,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:18,232 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:18,346 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:18,346 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:18,346 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:18,346 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:18,346 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:18,346 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:18,346 INFO ]: Start difference. First operand 7 states and 91 transitions. Second operand 3 states. [2018-06-25 08:13:19,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:19,419 INFO ]: Finished difference Result 8 states and 91 transitions. [2018-06-25 08:13:19,420 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:19,420 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:19,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:19,420 INFO ]: With dead ends: 8 [2018-06-25 08:13:19,420 INFO ]: Without dead ends: 7 [2018-06-25 08:13:19,420 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:19,420 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:19,421 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:19,421 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:19,421 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-06-25 08:13:19,421 INFO ]: Start accepts. Automaton has 7 states and 67 transitions. Word has length 6 [2018-06-25 08:13:19,421 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:19,421 INFO ]: Abstraction has 7 states and 67 transitions. [2018-06-25 08:13:19,421 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:19,421 INFO ]: Start isEmpty. Operand 7 states and 67 transitions. [2018-06-25 08:13:19,421 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:19,421 INFO ]: Found error trace [2018-06-25 08:13:19,422 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:19,422 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:19,422 INFO ]: Analyzing trace with hash -716961242, now seen corresponding path program 1 times [2018-06-25 08:13:19,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:19,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:19,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:19,422 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,433 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:19,543 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:19,544 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:19,544 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:19,544 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:19,544 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:19,544 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:19,544 INFO ]: Start difference. First operand 7 states and 67 transitions. Second operand 3 states. [2018-06-25 08:13:19,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:19,747 INFO ]: Finished difference Result 8 states and 67 transitions. [2018-06-25 08:13:19,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:19,748 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:19,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:19,748 INFO ]: With dead ends: 8 [2018-06-25 08:13:19,748 INFO ]: Without dead ends: 7 [2018-06-25 08:13:19,748 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:19,748 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:19,749 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:19,749 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:19,749 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-06-25 08:13:19,749 INFO ]: Start accepts. Automaton has 7 states and 37 transitions. Word has length 6 [2018-06-25 08:13:19,749 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:19,749 INFO ]: Abstraction has 7 states and 37 transitions. [2018-06-25 08:13:19,749 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:19,749 INFO ]: Start isEmpty. Operand 7 states and 37 transitions. [2018-06-25 08:13:19,749 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:19,749 INFO ]: Found error trace [2018-06-25 08:13:19,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:19,749 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:19,749 INFO ]: Analyzing trace with hash -418663959, now seen corresponding path program 1 times [2018-06-25 08:13:19,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:19,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:19,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:19,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,758 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:19,837 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:19,837 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:19,837 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:19,837 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:19,837 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:19,837 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:19,837 INFO ]: Start difference. First operand 7 states and 37 transitions. Second operand 3 states. [2018-06-25 08:13:19,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:19,863 INFO ]: Finished difference Result 8 states and 37 transitions. [2018-06-25 08:13:19,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:19,863 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:19,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:19,863 INFO ]: With dead ends: 8 [2018-06-25 08:13:19,863 INFO ]: Without dead ends: 7 [2018-06-25 08:13:19,863 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-25 08:13:19,863 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:19,864 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:19,864 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:19,864 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-06-25 08:13:19,864 INFO ]: Start accepts. Automaton has 7 states and 27 transitions. Word has length 6 [2018-06-25 08:13:19,864 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:19,864 INFO ]: Abstraction has 7 states and 27 transitions. [2018-06-25 08:13:19,864 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:19,864 INFO ]: Start isEmpty. Operand 7 states and 27 transitions. [2018-06-25 08:13:19,864 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:19,864 INFO ]: Found error trace [2018-06-25 08:13:19,864 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:19,864 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:19,865 INFO ]: Analyzing trace with hash -40020349, now seen corresponding path program 1 times [2018-06-25 08:13:19,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:19,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:19,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:19,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:19,871 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:19,980 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:19,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:19,980 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:19,980 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:19,980 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:19,980 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:19,981 INFO ]: Start difference. First operand 7 states and 27 transitions. Second operand 3 states. [2018-06-25 08:13:20,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:20,256 INFO ]: Finished difference Result 8 states and 27 transitions. [2018-06-25 08:13:20,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:20,256 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:20,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:20,257 INFO ]: With dead ends: 8 [2018-06-25 08:13:20,257 INFO ]: Without dead ends: 7 [2018-06-25 08:13:20,257 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-25 08:13:20,257 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:20,258 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:20,258 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:20,258 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-06-25 08:13:20,258 INFO ]: Start accepts. Automaton has 7 states and 25 transitions. Word has length 6 [2018-06-25 08:13:20,258 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:20,258 INFO ]: Abstraction has 7 states and 25 transitions. [2018-06-25 08:13:20,258 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:20,258 INFO ]: Start isEmpty. Operand 7 states and 25 transitions. [2018-06-25 08:13:20,258 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:20,258 INFO ]: Found error trace [2018-06-25 08:13:20,258 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:20,258 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:20,258 INFO ]: Analyzing trace with hash -570121403, now seen corresponding path program 1 times [2018-06-25 08:13:20,258 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:20,258 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:20,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:20,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:20,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:20,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:20,372 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:20,372 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:20,372 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:20,372 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:20,372 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:20,372 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:20,372 INFO ]: Start difference. First operand 7 states and 25 transitions. Second operand 3 states. [2018-06-25 08:13:20,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:20,461 INFO ]: Finished difference Result 8 states and 25 transitions. [2018-06-25 08:13:20,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:20,461 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 08:13:20,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:20,462 INFO ]: With dead ends: 8 [2018-06-25 08:13:20,462 INFO ]: Without dead ends: 7 [2018-06-25 08:13:20,462 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-25 08:13:20,462 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 08:13:20,462 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 08:13:20,462 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 08:13:20,463 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-06-25 08:13:20,463 INFO ]: Start accepts. Automaton has 7 states and 17 transitions. Word has length 6 [2018-06-25 08:13:20,463 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:20,463 INFO ]: Abstraction has 7 states and 17 transitions. [2018-06-25 08:13:20,463 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:20,463 INFO ]: Start isEmpty. Operand 7 states and 17 transitions. [2018-06-25 08:13:20,463 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:20,463 INFO ]: Found error trace [2018-06-25 08:13:20,463 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:20,463 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:20,463 INFO ]: Analyzing trace with hash -789919401, now seen corresponding path program 1 times [2018-06-25 08:13:20,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:20,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:20,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:20,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:20,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:20,472 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:20,577 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:20,577 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:20,577 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-25 08:13:20,585 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:20,649 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:20,655 INFO ]: Computing forward predicates... [2018-06-25 08:13:20,751 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:20,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:20,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 08:13:20,781 INFO ]: Interpolant automaton has 6 states [2018-06-25 08:13:20,781 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 08:13:20,781 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:13:20,781 INFO ]: Start difference. First operand 7 states and 17 transitions. Second operand 6 states. [2018-06-25 08:13:21,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:21,029 INFO ]: Finished difference Result 10 states and 20 transitions. [2018-06-25 08:13:21,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:13:21,029 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 08:13:21,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:21,029 INFO ]: With dead ends: 10 [2018-06-25 08:13:21,029 INFO ]: Without dead ends: 10 [2018-06-25 08:13:21,029 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:13:21,030 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 08:13:21,030 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 08:13:21,031 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 08:13:21,031 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-06-25 08:13:21,031 INFO ]: Start accepts. Automaton has 9 states and 19 transitions. Word has length 6 [2018-06-25 08:13:21,031 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:21,031 INFO ]: Abstraction has 9 states and 19 transitions. [2018-06-25 08:13:21,031 INFO ]: Interpolant automaton has 6 states. [2018-06-25 08:13:21,031 INFO ]: Start isEmpty. Operand 9 states and 19 transitions. [2018-06-25 08:13:21,031 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 08:13:21,031 INFO ]: Found error trace [2018-06-25 08:13:21,031 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 08:13:21,031 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:21,031 INFO ]: Analyzing trace with hash -472228177, now seen corresponding path program 1 times [2018-06-25 08:13:21,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:21,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:21,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:21,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:21,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:21,049 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:21,253 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:21,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:21,253 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) [2018-06-25 08:13:21,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:13:21,315 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:21,317 INFO ]: Computing forward predicates... [2018-06-25 08:13:21,358 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:21,391 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:21,391 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 08:13:21,391 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:13:21,391 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:13:21,391 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:13:21,391 INFO ]: Start difference. First operand 9 states and 19 transitions. Second operand 4 states. [2018-06-25 08:13:21,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:21,718 INFO ]: Finished difference Result 14 states and 24 transitions. [2018-06-25 08:13:21,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:13:21,718 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 08:13:21,718 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:21,718 INFO ]: With dead ends: 14 [2018-06-25 08:13:21,718 INFO ]: Without dead ends: 14 [2018-06-25 08:13:21,718 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:13:21,718 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 08:13:21,719 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-06-25 08:13:21,719 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 08:13:21,720 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-06-25 08:13:21,720 INFO ]: Start accepts. Automaton has 9 states and 19 transitions. Word has length 6 [2018-06-25 08:13:21,720 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:21,720 INFO ]: Abstraction has 9 states and 19 transitions. [2018-06-25 08:13:21,720 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:13:21,720 INFO ]: Start isEmpty. Operand 9 states and 19 transitions. [2018-06-25 08:13:21,720 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 08:13:21,720 INFO ]: Found error trace [2018-06-25 08:13:21,720 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 08:13:21,720 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:21,720 INFO ]: Analyzing trace with hash -1872641598, now seen corresponding path program 2 times [2018-06-25 08:13:21,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:21,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:21,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:21,721 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:21,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:21,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:22,008 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:22,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:22,008 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) [2018-06-25 08:13:22,022 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:13:22,078 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:13:22,078 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:22,080 INFO ]: Computing forward predicates... [2018-06-25 08:13:22,271 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:22,301 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:22,301 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 08:13:22,301 INFO ]: Interpolant automaton has 6 states [2018-06-25 08:13:22,301 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 08:13:22,301 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:13:22,301 INFO ]: Start difference. First operand 9 states and 19 transitions. Second operand 6 states. [2018-06-25 08:13:22,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:22,955 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-25 08:13:22,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:13:22,955 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 08:13:22,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:22,955 INFO ]: With dead ends: 13 [2018-06-25 08:13:22,955 INFO ]: Without dead ends: 13 [2018-06-25 08:13:22,956 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:13:22,956 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 08:13:22,956 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 08:13:22,956 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 08:13:22,957 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-25 08:13:22,957 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 7 [2018-06-25 08:13:22,957 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:22,957 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-25 08:13:22,957 INFO ]: Interpolant automaton has 6 states. [2018-06-25 08:13:22,957 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-25 08:13:22,957 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:13:22,957 INFO ]: Found error trace [2018-06-25 08:13:22,957 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 08:13:22,957 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:22,957 INFO ]: Analyzing trace with hash 1600594359, now seen corresponding path program 2 times [2018-06-25 08:13:22,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:22,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:22,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:22,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:13:22,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:22,970 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:23,285 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 08:13:23,285 INFO ]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:13:23,285 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:23,285 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-25 08:13:23,300 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-25 08:13:23,362 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:13:23,362 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:23,364 INFO ]: Computing forward predicates... [2018-06-25 08:13:24,361 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:24,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:24,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-25 08:13:24,387 INFO ]: Interpolant automaton has 8 states [2018-06-25 08:13:24,387 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 08:13:24,387 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:13:24,388 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 8 states. [2018-06-25 08:13:24,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:24,647 INFO ]: Finished difference Result 21 states and 29 transitions. [2018-06-25 08:13:24,647 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 08:13:24,647 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-25 08:13:24,647 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:24,647 INFO ]: With dead ends: 21 [2018-06-25 08:13:24,647 INFO ]: Without dead ends: 18 [2018-06-25 08:13:24,648 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:13:24,648 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:13:24,649 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 11. [2018-06-25 08:13:24,649 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 08:13:24,649 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-25 08:13:24,649 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-06-25 08:13:24,649 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:24,649 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-25 08:13:24,649 INFO ]: Interpolant automaton has 8 states. [2018-06-25 08:13:24,649 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-25 08:13:24,649 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:13:24,649 INFO ]: Found error trace [2018-06-25 08:13:24,649 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 08:13:24,649 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:24,650 INFO ]: Analyzing trace with hash -1296637923, now seen corresponding path program 1 times [2018-06-25 08:13:24,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:24,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:24,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:24,650 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:13:24,650 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:24,662 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:24,763 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 08:13:24,763 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:13:24,763 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:13:24,763 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:13:24,763 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:13:24,763 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:13:24,763 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-25 08:13:24,888 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:24,888 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-25 08:13:24,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:13:24,890 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 08:13:24,890 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:24,890 INFO ]: With dead ends: 13 [2018-06-25 08:13:24,890 INFO ]: Without dead ends: 11 [2018-06-25 08:13:24,891 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-25 08:13:24,891 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 08:13:24,891 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 08:13:24,891 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 08:13:24,892 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-25 08:13:24,892 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-25 08:13:24,892 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:24,892 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-25 08:13:24,892 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:13:24,892 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-25 08:13:24,892 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:13:24,892 INFO ]: Found error trace [2018-06-25 08:13:24,892 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 08:13:24,892 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:24,892 INFO ]: Analyzing trace with hash 216372272, now seen corresponding path program 1 times [2018-06-25 08:13:24,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:24,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:24,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:24,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:24,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:24,906 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:25,221 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 08:13:25,248 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:25,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:25,248 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-25 08:13:25,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:25,301 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:25,304 INFO ]: Computing forward predicates... [2018-06-25 08:13:25,654 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:25,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:25,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-25 08:13:25,674 INFO ]: Interpolant automaton has 9 states [2018-06-25 08:13:25,674 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 08:13:25,674 INFO ]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-25 08:13:25,674 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 9 states. [2018-06-25 08:13:25,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:25,773 INFO ]: Finished difference Result 19 states and 25 transitions. [2018-06-25 08:13:25,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:13:25,774 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-25 08:13:25,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:25,774 INFO ]: With dead ends: 19 [2018-06-25 08:13:25,774 INFO ]: Without dead ends: 14 [2018-06-25 08:13:25,774 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:13:25,774 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 08:13:25,775 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 08:13:25,775 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 08:13:25,775 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-06-25 08:13:25,776 INFO ]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 8 [2018-06-25 08:13:25,776 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:25,776 INFO ]: Abstraction has 11 states and 15 transitions. [2018-06-25 08:13:25,776 INFO ]: Interpolant automaton has 9 states. [2018-06-25 08:13:25,776 INFO ]: Start isEmpty. Operand 11 states and 15 transitions. [2018-06-25 08:13:25,776 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:13:25,776 INFO ]: Found error trace [2018-06-25 08:13:25,776 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-25 08:13:25,776 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:25,776 INFO ]: Analyzing trace with hash 1655396289, now seen corresponding path program 1 times [2018-06-25 08:13:25,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:25,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:25,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:25,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:25,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:25,795 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:26,005 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-06-25 08:13:26,028 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:26,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:26,028 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-25 08:13:26,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:26,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:26,074 INFO ]: Computing forward predicates... [2018-06-25 08:13:26,193 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:26,212 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:26,212 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-25 08:13:26,213 INFO ]: Interpolant automaton has 10 states [2018-06-25 08:13:26,213 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 08:13:26,213 INFO ]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-25 08:13:26,213 INFO ]: Start difference. First operand 11 states and 15 transitions. Second operand 10 states. [2018-06-25 08:13:26,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:26,271 INFO ]: Finished difference Result 21 states and 25 transitions. [2018-06-25 08:13:26,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 08:13:26,271 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-25 08:13:26,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:26,271 INFO ]: With dead ends: 21 [2018-06-25 08:13:26,271 INFO ]: Without dead ends: 21 [2018-06-25 08:13:26,272 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:13:26,272 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 08:13:26,272 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 12. [2018-06-25 08:13:26,272 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 08:13:26,273 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-25 08:13:26,273 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-06-25 08:13:26,273 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:26,273 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-25 08:13:26,273 INFO ]: Interpolant automaton has 10 states. [2018-06-25 08:13:26,273 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-25 08:13:26,273 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:13:26,273 INFO ]: Found error trace [2018-06-25 08:13:26,273 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 08:13:26,273 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:26,273 INFO ]: Analyzing trace with hash 2082737007, now seen corresponding path program 3 times [2018-06-25 08:13:26,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:26,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:26,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:26,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:26,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:26,291 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:26,558 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:26,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:26,558 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-25 08:13:26,564 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:13:26,610 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 08:13:26,610 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:26,613 INFO ]: Computing forward predicates... [2018-06-25 08:13:26,618 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:27,124 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:27,144 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:27,144 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 08:13:27,144 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:13:27,144 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:13:27,144 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:13:27,144 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 13 states. [2018-06-25 08:13:27,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:27,851 INFO ]: Finished difference Result 18 states and 22 transitions. [2018-06-25 08:13:27,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:13:27,851 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-25 08:13:27,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:27,851 INFO ]: With dead ends: 18 [2018-06-25 08:13:27,851 INFO ]: Without dead ends: 18 [2018-06-25 08:13:27,851 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:13:27,851 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:13:27,852 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-25 08:13:27,852 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 08:13:27,852 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-25 08:13:27,852 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-25 08:13:27,852 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:27,852 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-25 08:13:27,853 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:13:27,853 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-25 08:13:27,853 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:13:27,853 INFO ]: Found error trace [2018-06-25 08:13:27,853 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-25 08:13:27,853 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:27,853 INFO ]: Analyzing trace with hash -2093105759, now seen corresponding path program 2 times [2018-06-25 08:13:27,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:27,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:27,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:27,854 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:13:27,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:27,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:28,023 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:28,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:28,023 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-25 08:13:28,038 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:13:28,088 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:13:28,088 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:28,092 INFO ]: Computing forward predicates... [2018-06-25 08:13:28,328 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 08:13:28,423 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:28,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:28,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 08:13:28,443 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:13:28,443 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:13:28,443 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:13:28,443 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2018-06-25 08:13:28,908 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2018-06-25 08:13:28,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:28,911 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-25 08:13:28,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 08:13:28,911 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-25 08:13:28,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:28,911 INFO ]: With dead ends: 26 [2018-06-25 08:13:28,911 INFO ]: Without dead ends: 26 [2018-06-25 08:13:28,912 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:13:28,912 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:13:28,913 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 13. [2018-06-25 08:13:28,913 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 08:13:28,913 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-25 08:13:28,913 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2018-06-25 08:13:28,913 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:28,913 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-25 08:13:28,913 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:13:28,913 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-25 08:13:28,914 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:13:28,914 INFO ]: Found error trace [2018-06-25 08:13:28,914 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-25 08:13:28,914 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:28,914 INFO ]: Analyzing trace with hash -243871706, now seen corresponding path program 1 times [2018-06-25 08:13:28,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:28,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:28,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:28,914 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:13:28,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:28,935 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:29,210 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:29,210 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:29,210 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-25 08:13:29,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:29,286 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:29,290 INFO ]: Computing forward predicates... [2018-06-25 08:13:29,295 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 08:13:29,477 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:29,608 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:29,703 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:29,802 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:30,381 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:30,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:30,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-06-25 08:13:30,417 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:13:30,417 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:13:30,417 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:13:30,417 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 15 states. [2018-06-25 08:13:30,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:30,712 INFO ]: Finished difference Result 20 states and 24 transitions. [2018-06-25 08:13:30,713 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 08:13:30,713 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-25 08:13:30,713 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:30,713 INFO ]: With dead ends: 20 [2018-06-25 08:13:30,713 INFO ]: Without dead ends: 20 [2018-06-25 08:13:30,713 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-06-25 08:13:30,713 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 08:13:30,714 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-06-25 08:13:30,714 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:13:30,714 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-25 08:13:30,715 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2018-06-25 08:13:30,715 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:30,715 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-25 08:13:30,715 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:13:30,715 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-25 08:13:30,715 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:13:30,715 INFO ]: Found error trace [2018-06-25 08:13:30,715 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-25 08:13:30,715 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:30,715 INFO ]: Analyzing trace with hash 136982227, now seen corresponding path program 1 times [2018-06-25 08:13:30,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:30,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:30,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:30,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:30,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:30,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:31,146 WARN ]: Spent 340.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-25 08:13:31,326 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-25 08:13:31,575 WARN ]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 08:13:31,709 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:31,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:31,709 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) [2018-06-25 08:13:31,725 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:13:31,775 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:31,779 INFO ]: Computing forward predicates... [2018-06-25 08:13:31,823 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 08:13:31,895 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 08:13:31,920 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 08:13:33,101 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,122 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,133 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,152 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,204 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,213 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,221 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,240 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,256 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,266 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,274 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,281 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,298 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,315 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:33,333 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:35,206 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:35,230 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:35,230 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 08:13:35,230 INFO ]: Interpolant automaton has 16 states [2018-06-25 08:13:35,230 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 08:13:35,230 INFO ]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:13:35,230 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 16 states. [2018-06-25 08:13:35,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:35,764 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-25 08:13:35,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 08:13:35,765 INFO ]: Start accepts. Automaton has 16 states. Word has length 11 [2018-06-25 08:13:35,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:35,765 INFO ]: With dead ends: 26 [2018-06-25 08:13:35,765 INFO ]: Without dead ends: 26 [2018-06-25 08:13:35,765 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:13:35,765 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 08:13:35,766 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-06-25 08:13:35,766 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:13:35,766 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-25 08:13:35,766 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2018-06-25 08:13:35,766 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:35,766 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-25 08:13:35,766 INFO ]: Interpolant automaton has 16 states. [2018-06-25 08:13:35,766 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-25 08:13:35,766 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:13:35,766 INFO ]: Found error trace [2018-06-25 08:13:35,766 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-25 08:13:35,767 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:35,767 INFO ]: Analyzing trace with hash 559431119, now seen corresponding path program 4 times [2018-06-25 08:13:35,767 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:35,767 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:35,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:35,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:13:35,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:35,792 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:36,137 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:36,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:36,137 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-25 08:13:36,144 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:13:36,198 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:13:36,198 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:36,202 INFO ]: Computing forward predicates... [2018-06-25 08:13:36,206 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 08:13:37,837 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:37,881 WARN ]: expecting exponential blowup for input size 9 [2018-06-25 08:13:38,819 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:38,829 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:38,840 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:38,851 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:40,702 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 18 [2018-06-25 08:13:40,704 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:40,752 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:13:40,752 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-25 08:13:40,752 INFO ]: Interpolant automaton has 17 states [2018-06-25 08:13:40,752 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 08:13:40,752 INFO ]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-25 08:13:40,752 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 17 states. [2018-06-25 08:13:41,418 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-06-25 08:13:41,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:13:41,497 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-25 08:13:41,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:13:41,498 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-25 08:13:41,498 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:13:41,498 INFO ]: With dead ends: 28 [2018-06-25 08:13:41,498 INFO ]: Without dead ends: 28 [2018-06-25 08:13:41,499 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-06-25 08:13:41,499 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 08:13:41,500 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 15. [2018-06-25 08:13:41,500 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:13:41,500 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-25 08:13:41,500 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2018-06-25 08:13:41,500 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:13:41,500 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-25 08:13:41,500 INFO ]: Interpolant automaton has 17 states. [2018-06-25 08:13:41,500 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-25 08:13:41,500 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:13:41,500 INFO ]: Found error trace [2018-06-25 08:13:41,500 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-25 08:13:41,500 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:13:41,500 INFO ]: Analyzing trace with hash -926012543, now seen corresponding path program 3 times [2018-06-25 08:13:41,500 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:13:41,500 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:13:41,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:41,501 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:13:41,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:13:41,526 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:41,888 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:13:41,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:13:41,889 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) [2018-06-25 08:13:41,903 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:13:41,963 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 08:13:41,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:13:41,968 INFO ]: Computing forward predicates... [2018-06-25 08:13:42,375 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:42,381 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 08:13:42,516 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 08:13:43,025 WARN ]: expecting exponential blowup for input size 10 [2018-06-25 08:13:43,120 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:43,166 WARN ]: expecting exponential blowup for input size 8 [2018-06-25 08:13:43,217 WARN ]: expecting exponential blowup for input size 10 Received shutdown request... [2018-06-25 08:13:43,620 INFO ]: Timeout while computing interpolants [2018-06-25 08:13:43,821 WARN ]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:13:43,821 WARN ]: Verification canceled [2018-06-25 08:13:43,823 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 08:13:43,824 WARN ]: Timeout [2018-06-25 08:13:43,824 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:13:43 BasicIcfg [2018-06-25 08:13:43,824 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:13:43,828 INFO ]: Toolchain (without parser) took 54527.30 ms. Allocated memory was 302.0 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 254.5 MB in the beginning and 1.1 GB in the end (delta: -818.8 MB). Peak memory consumption was 280.2 MB. Max. memory is 3.6 GB. [2018-06-25 08:13:43,828 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 302.0 MB. Free memory is still 266.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:13:43,829 INFO ]: ChcToBoogie took 59.64 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:13:43,829 INFO ]: Boogie Preprocessor took 41.66 ms. Allocated memory is still 302.0 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:13:43,829 INFO ]: RCFGBuilder took 286.05 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 238.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:13:43,830 INFO ]: BlockEncodingV2 took 12482.36 ms. Allocated memory was 302.0 MB in the beginning and 578.8 MB in the end (delta: 276.8 MB). Free memory was 238.6 MB in the beginning and 179.1 MB in the end (delta: 59.5 MB). Peak memory consumption was 367.5 MB. Max. memory is 3.6 GB. [2018-06-25 08:13:43,830 INFO ]: TraceAbstraction took 41646.24 ms. Allocated memory was 578.8 MB in the beginning and 1.4 GB in the end (delta: 822.1 MB). Free memory was 179.1 MB in the beginning and 1.1 GB in the end (delta: -894.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:13:43,834 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2054 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 302.0 MB. Free memory is still 266.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.64 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.66 ms. Allocated memory is still 302.0 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 286.05 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 238.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 12482.36 ms. Allocated memory was 302.0 MB in the beginning and 578.8 MB in the end (delta: 276.8 MB). Free memory was 238.6 MB in the beginning and 179.1 MB in the end (delta: 59.5 MB). Peak memory consumption was 367.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 41646.24 ms. Allocated memory was 578.8 MB in the beginning and 1.4 GB in the end (delta: 822.1 MB). Free memory was 179.1 MB in the beginning and 1.1 GB in the end (delta: -894.2 MB). There was no memory consumed. 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 13 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 40.5s OverallTime, 30 OverallIterations, 7 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12355 SDtfs, 4 SDslu, 288 SDs, 0 SdLazy, 7785 SolverSat, 5321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=29, 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, 29 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 9810 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3128 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 40 InterpolantComputations, 18 PerfectInterpolantSequences, 26/267 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/twisted_counters.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_08-13-43-848.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/twisted_counters.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_08-13-43-848.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/twisted_counters.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_08-13-43-848.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/twisted_counters.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-13-43-848.csv Completed graceful shutdown