java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 22:00:17,693 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 22:00:17,695 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 22:00:17,708 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 22:00:17,708 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 22:00:17,709 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 22:00:17,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 22:00:17,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 22:00:17,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 22:00:17,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 22:00:17,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 22:00:17,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 22:00:17,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 22:00:17,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 22:00:17,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 22:00:17,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 22:00:17,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 22:00:17,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 22:00:17,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 22:00:17,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 22:00:17,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 22:00:17,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 22:00:17,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 22:00:17,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 22:00:17,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 22:00:17,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 22:00:17,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 22:00:17,758 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 22:00:17,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 22:00:17,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 22:00:17,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 22:00:17,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 22:00:17,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 22:00:17,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 22:00:17,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 22:00:17,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 22:00:17,766 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 22:00:17,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 22:00:17,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 22:00:17,794 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 22:00:17,798 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 22:00:17,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 22:00:17,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 22:00:17,800 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 22:00:17,800 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 22:00:17,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 22:00:17,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 22:00:17,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 22:00:17,801 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 22:00:17,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:00:17,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 22:00:17,801 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 22:00:17,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 22:00:17,802 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 22:00:17,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 22:00:17,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 22:00:17,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 22:00:17,802 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 22:00:17,804 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 22:00:17,804 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 22:00:17,857 INFO ]: Repository-Root is: /tmp [2018-06-26 22:00:17,873 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 22:00:17,879 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 22:00:17,882 INFO ]: Initializing SmtParser... [2018-06-26 22:00:17,882 INFO ]: SmtParser initialized [2018-06-26 22:00:17,883 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 [2018-06-26 22:00:17,884 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 22:00:17,973 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 unknown [2018-06-26 22:00:18,457 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd-some-loop.c.smt2 [2018-06-26 22:00:18,464 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 22:00:18,472 INFO ]: Walking toolchain with 5 elements. [2018-06-26 22:00:18,472 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 22:00:18,473 INFO ]: Initializing ChcToBoogie... [2018-06-26 22:00:18,473 INFO ]: ChcToBoogie initialized [2018-06-26 22:00:18,476 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,541 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18 Unit [2018-06-26 22:00:18,541 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 22:00:18,542 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 22:00:18,542 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 22:00:18,542 INFO ]: Boogie Preprocessor initialized [2018-06-26 22:00:18,562 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,562 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,584 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,584 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,603 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,614 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,618 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... [2018-06-26 22:00:18,631 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 22:00:18,632 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 22:00:18,632 INFO ]: Initializing RCFGBuilder... [2018-06-26 22:00:18,632 INFO ]: RCFGBuilder initialized [2018-06-26 22:00:18,633 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 22:00:18,654 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 22:00:18,654 INFO ]: Found specification of procedure gotoProc [2018-06-26 22:00:18,654 INFO ]: Found implementation of procedure gotoProc [2018-06-26 22:00:18,654 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 22:00:18,654 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 22:00:18,654 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 22:00:19,042 INFO ]: Using library mode [2018-06-26 22:00:19,042 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:00:19 BoogieIcfgContainer [2018-06-26 22:00:19,042 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 22:00:19,043 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 22:00:19,043 INFO ]: Initializing BlockEncodingV2... [2018-06-26 22:00:19,045 INFO ]: BlockEncodingV2 initialized [2018-06-26 22:00:19,046 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:00:19" (1/1) ... [2018-06-26 22:00:19,064 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 22:00:19,066 INFO ]: Using Remove infeasible edges [2018-06-26 22:00:19,066 INFO ]: Using Maximize final states [2018-06-26 22:00:19,068 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 22:00:19,068 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 22:00:19,070 INFO ]: Using Remove sink states [2018-06-26 22:00:19,070 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 22:00:19,071 INFO ]: Using Use SBE [2018-06-26 22:00:19,080 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 22:00:19,241 WARN ]: aborting because of expected exponential blowup for input size 135 [2018-06-26 22:00:19,257 WARN ]: aborting because of expected exponential blowup for input size 135 [2018-06-26 22:00:19,257 INFO ]: SBE split 1 edges [2018-06-26 22:00:19,264 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 22:00:19,266 INFO ]: 0 new accepting states [2018-06-26 22:00:19,646 INFO ]: Removed 25 edges and 2 locations by large block encoding [2018-06-26 22:00:19,648 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:00:19,650 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 22:00:19,650 INFO ]: 0 new accepting states [2018-06-26 22:00:19,650 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 22:00:19,650 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 22:00:19,650 INFO ]: Encoded RCFG 6 locations, 27 edges [2018-06-26 22:00:19,651 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:00:19 BasicIcfg [2018-06-26 22:00:19,651 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 22:00:19,652 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 22:00:19,652 INFO ]: Initializing TraceAbstraction... [2018-06-26 22:00:19,655 INFO ]: TraceAbstraction initialized [2018-06-26 22:00:19,655 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 10:00:18" (1/4) ... [2018-06-26 22:00:19,656 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8b444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 10:00:19, skipping insertion in model container [2018-06-26 22:00:19,656 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 10:00:18" (2/4) ... [2018-06-26 22:00:19,656 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8b444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 10:00:19, skipping insertion in model container [2018-06-26 22:00:19,657 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 10:00:19" (3/4) ... [2018-06-26 22:00:19,657 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c8b444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:00:19, skipping insertion in model container [2018-06-26 22:00:19,657 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 10:00:19" (4/4) ... [2018-06-26 22:00:19,658 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 22:00:19,668 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 22:00:19,673 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 22:00:19,712 INFO ]: Using default assertion order modulation [2018-06-26 22:00:19,713 INFO ]: Interprodecural is true [2018-06-26 22:00:19,713 INFO ]: Hoare is false [2018-06-26 22:00:19,713 INFO ]: Compute interpolants for FPandBP [2018-06-26 22:00:19,713 INFO ]: Backedges is TWOTRACK [2018-06-26 22:00:19,713 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 22:00:19,713 INFO ]: Difference is false [2018-06-26 22:00:19,713 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 22:00:19,713 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 22:00:19,727 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 22:00:19,738 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:00:19,738 INFO ]: Found error trace [2018-06-26 22:00:19,739 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:00:19,739 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:19,744 INFO ]: Analyzing trace with hash 36099287, now seen corresponding path program 1 times [2018-06-26 22:00:19,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:19,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:19,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:19,783 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:19,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:19,832 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:19,897 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:19,908 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:00:19,909 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:00:19,910 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:00:19,936 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:00:19,936 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:19,938 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 22:00:20,228 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:20,228 INFO ]: Finished difference Result 7 states and 28 transitions. [2018-06-26 22:00:20,228 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:00:20,229 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:00:20,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:20,239 INFO ]: With dead ends: 7 [2018-06-26 22:00:20,239 INFO ]: Without dead ends: 7 [2018-06-26 22:00:20,241 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,257 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 22:00:20,272 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 22:00:20,273 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:00:20,274 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-26 22:00:20,276 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-26 22:00:20,276 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:20,276 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-26 22:00:20,276 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:00:20,276 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-26 22:00:20,277 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:00:20,277 INFO ]: Found error trace [2018-06-26 22:00:20,277 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:00:20,277 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:20,277 INFO ]: Analyzing trace with hash 36129078, now seen corresponding path program 1 times [2018-06-26 22:00:20,277 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:20,277 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:20,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:20,278 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,287 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:20,300 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:20,301 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:00:20,301 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:00:20,302 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:00:20,302 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:00:20,302 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,302 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-26 22:00:20,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:20,609 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-26 22:00:20,610 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:00:20,610 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:00:20,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:20,610 INFO ]: With dead ends: 9 [2018-06-26 22:00:20,610 INFO ]: Without dead ends: 9 [2018-06-26 22:00:20,611 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,611 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:00:20,613 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 22:00:20,613 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:00:20,613 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-26 22:00:20,613 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-26 22:00:20,614 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:20,614 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-26 22:00:20,614 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:00:20,614 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-26 22:00:20,616 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:00:20,616 INFO ]: Found error trace [2018-06-26 22:00:20,616 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:00:20,616 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:20,616 INFO ]: Analyzing trace with hash 36188660, now seen corresponding path program 1 times [2018-06-26 22:00:20,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:20,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:20,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:20,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,629 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:20,645 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:20,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:00:20,646 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:00:20,646 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:00:20,646 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:00:20,646 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,646 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-26 22:00:20,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:20,821 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-26 22:00:20,821 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:00:20,821 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:00:20,821 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:20,822 INFO ]: With dead ends: 9 [2018-06-26 22:00:20,822 INFO ]: Without dead ends: 9 [2018-06-26 22:00:20,822 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,822 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:00:20,824 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 22:00:20,824 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:00:20,824 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-26 22:00:20,824 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-26 22:00:20,825 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:20,825 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-26 22:00:20,825 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:00:20,825 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-26 22:00:20,825 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 22:00:20,825 INFO ]: Found error trace [2018-06-26 22:00:20,825 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 22:00:20,825 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:20,825 INFO ]: Analyzing trace with hash 36307824, now seen corresponding path program 1 times [2018-06-26 22:00:20,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:20,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:20,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:20,826 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:20,833 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:20,899 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:20,899 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 22:00:20,899 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 22:00:20,899 INFO ]: Interpolant automaton has 3 states [2018-06-26 22:00:20,899 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 22:00:20,899 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 22:00:20,900 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 3 states. [2018-06-26 22:00:21,044 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:21,044 INFO ]: Finished difference Result 9 states and 30 transitions. [2018-06-26 22:00:21,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 22:00:21,045 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 22:00:21,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:21,045 INFO ]: With dead ends: 9 [2018-06-26 22:00:21,045 INFO ]: Without dead ends: 9 [2018-06-26 22:00:21,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-26 22:00:21,045 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 22:00:21,047 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 22:00:21,047 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 22:00:21,047 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-06-26 22:00:21,048 INFO ]: Start accepts. Automaton has 7 states and 28 transitions. Word has length 5 [2018-06-26 22:00:21,048 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:21,048 INFO ]: Abstraction has 7 states and 28 transitions. [2018-06-26 22:00:21,048 INFO ]: Interpolant automaton has 3 states. [2018-06-26 22:00:21,048 INFO ]: Start isEmpty. Operand 7 states and 28 transitions. [2018-06-26 22:00:21,048 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:00:21,048 INFO ]: Found error trace [2018-06-26 22:00:21,048 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:00:21,048 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:21,048 INFO ]: Analyzing trace with hash 1117572169, now seen corresponding path program 1 times [2018-06-26 22:00:21,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:21,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:21,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:21,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:21,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:21,133 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:21,317 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:21,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:21,317 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:21,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:21,387 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:21,396 INFO ]: Computing forward predicates... [2018-06-26 22:00:21,745 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:21,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:21,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 22:00:21,765 INFO ]: Interpolant automaton has 5 states [2018-06-26 22:00:21,765 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 22:00:21,765 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 22:00:21,765 INFO ]: Start difference. First operand 7 states and 28 transitions. Second operand 5 states. [2018-06-26 22:00:22,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:22,116 INFO ]: Finished difference Result 12 states and 33 transitions. [2018-06-26 22:00:22,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 22:00:22,117 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 22:00:22,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:22,118 INFO ]: With dead ends: 12 [2018-06-26 22:00:22,118 INFO ]: Without dead ends: 12 [2018-06-26 22:00:22,118 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:22,118 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 22:00:22,120 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 22:00:22,120 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:22,120 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 22:00:22,120 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 6 [2018-06-26 22:00:22,120 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:22,120 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 22:00:22,120 INFO ]: Interpolant automaton has 5 states. [2018-06-26 22:00:22,121 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 22:00:22,121 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 22:00:22,121 INFO ]: Found error trace [2018-06-26 22:00:22,121 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 22:00:22,121 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:22,121 INFO ]: Analyzing trace with hash 1119419211, now seen corresponding path program 1 times [2018-06-26 22:00:22,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:22,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:22,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:22,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:22,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:22,210 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:22,328 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:22,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:22,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:22,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:22,399 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:22,402 INFO ]: Computing forward predicates... [2018-06-26 22:00:22,813 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:22,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:22,840 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 22:00:22,840 INFO ]: Interpolant automaton has 4 states [2018-06-26 22:00:22,840 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 22:00:22,840 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:00:22,840 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 4 states. [2018-06-26 22:00:22,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:22,964 INFO ]: Finished difference Result 15 states and 36 transitions. [2018-06-26 22:00:22,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 22:00:22,965 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 22:00:22,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:22,966 INFO ]: With dead ends: 15 [2018-06-26 22:00:22,966 INFO ]: Without dead ends: 15 [2018-06-26 22:00:22,966 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 22:00:22,966 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 22:00:22,968 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 9. [2018-06-26 22:00:22,968 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:22,968 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 22:00:22,968 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 6 [2018-06-26 22:00:22,968 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:22,968 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 22:00:22,968 INFO ]: Interpolant automaton has 4 states. [2018-06-26 22:00:22,969 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 22:00:22,969 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:00:22,969 INFO ]: Found error trace [2018-06-26 22:00:22,969 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 22:00:22,969 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:22,969 INFO ]: Analyzing trace with hash 312122294, now seen corresponding path program 1 times [2018-06-26 22:00:22,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:22,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:22,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:22,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:22,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:23,021 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:23,141 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:23,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:23,141 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:23,148 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:23,223 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:23,227 INFO ]: Computing forward predicates... [2018-06-26 22:00:27,212 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:27,232 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:27,232 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:00:27,232 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:00:27,232 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:00:27,232 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:27,232 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-26 22:00:27,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:27,361 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-26 22:00:27,361 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:00:27,361 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 22:00:27,361 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:27,361 INFO ]: With dead ends: 16 [2018-06-26 22:00:27,362 INFO ]: Without dead ends: 16 [2018-06-26 22:00:27,362 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:00:27,362 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 22:00:27,364 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-26 22:00:27,364 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:27,364 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 22:00:27,364 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-26 22:00:27,364 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:27,364 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 22:00:27,364 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:00:27,364 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 22:00:27,365 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:00:27,365 INFO ]: Found error trace [2018-06-26 22:00:27,365 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 22:00:27,365 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:27,365 INFO ]: Analyzing trace with hash 340751445, now seen corresponding path program 2 times [2018-06-26 22:00:27,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:27,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:27,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:27,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:27,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:27,408 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:27,765 WARN ]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-26 22:00:27,809 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:27,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:27,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:27,815 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:00:27,874 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:00:27,874 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:27,877 INFO ]: Computing forward predicates... [2018-06-26 22:00:30,332 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:30,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:30,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:00:30,353 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:00:30,353 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:00:30,353 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:30,353 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-26 22:00:30,497 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:30,497 INFO ]: Finished difference Result 18 states and 39 transitions. [2018-06-26 22:00:30,497 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:00:30,497 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 22:00:30,497 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:30,498 INFO ]: With dead ends: 18 [2018-06-26 22:00:30,498 INFO ]: Without dead ends: 18 [2018-06-26 22:00:30,498 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-06-26 22:00:30,498 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 22:00:30,500 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 9. [2018-06-26 22:00:30,500 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:30,500 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 22:00:30,500 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-26 22:00:30,500 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:30,500 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 22:00:30,500 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:00:30,501 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 22:00:30,501 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:00:30,501 INFO ]: Found error trace [2018-06-26 22:00:30,501 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 22:00:30,501 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:30,501 INFO ]: Analyzing trace with hash 598413804, now seen corresponding path program 1 times [2018-06-26 22:00:30,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:30,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:30,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:30,502 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:00:30,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:30,566 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:30,747 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:30,748 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:30,748 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:30,753 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:30,813 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:30,816 INFO ]: Computing forward predicates... [2018-06-26 22:00:32,237 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:32,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:32,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:00:32,269 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:00:32,269 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:00:32,269 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:32,269 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 6 states. [2018-06-26 22:00:32,657 WARN ]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 22:00:32,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:32,765 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-26 22:00:32,765 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:00:32,765 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 22:00:32,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:32,765 INFO ]: With dead ends: 16 [2018-06-26 22:00:32,765 INFO ]: Without dead ends: 16 [2018-06-26 22:00:32,766 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:00:32,766 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 22:00:32,768 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 9. [2018-06-26 22:00:32,768 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:32,768 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-06-26 22:00:32,768 INFO ]: Start accepts. Automaton has 9 states and 30 transitions. Word has length 7 [2018-06-26 22:00:32,769 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:32,769 INFO ]: Abstraction has 9 states and 30 transitions. [2018-06-26 22:00:32,769 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:00:32,769 INFO ]: Start isEmpty. Operand 9 states and 30 transitions. [2018-06-26 22:00:32,769 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:00:32,769 INFO ]: Found error trace [2018-06-26 22:00:32,769 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 22:00:32,769 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:32,769 INFO ]: Analyzing trace with hash 196847113, now seen corresponding path program 2 times [2018-06-26 22:00:32,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:32,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:32,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:32,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:32,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:32,844 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:33,573 WARN ]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-26 22:00:33,821 WARN ]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-06-26 22:00:33,884 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:33,884 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:33,884 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:33,896 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:00:33,999 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:00:33,999 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:34,002 INFO ]: Computing forward predicates... [2018-06-26 22:00:34,778 WARN ]: expecting exponential blowup for input size 9 [2018-06-26 22:00:34,842 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:34,863 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:34,863 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 22:00:34,863 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:00:34,863 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:00:34,863 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:00:34,863 INFO ]: Start difference. First operand 9 states and 30 transitions. Second operand 7 states. [2018-06-26 22:00:35,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:35,179 INFO ]: Finished difference Result 18 states and 39 transitions. [2018-06-26 22:00:35,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 22:00:35,179 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 22:00:35,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:35,180 INFO ]: With dead ends: 18 [2018-06-26 22:00:35,180 INFO ]: Without dead ends: 18 [2018-06-26 22:00:35,180 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-06-26 22:00:35,180 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 22:00:35,182 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 11. [2018-06-26 22:00:35,182 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 22:00:35,182 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2018-06-26 22:00:35,182 INFO ]: Start accepts. Automaton has 11 states and 32 transitions. Word has length 8 [2018-06-26 22:00:35,182 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:35,182 INFO ]: Abstraction has 11 states and 32 transitions. [2018-06-26 22:00:35,182 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:00:35,182 INFO ]: Start isEmpty. Operand 11 states and 32 transitions. [2018-06-26 22:00:35,183 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:00:35,183 INFO ]: Found error trace [2018-06-26 22:00:35,183 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 22:00:35,183 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:35,183 INFO ]: Analyzing trace with hash 1971854475, now seen corresponding path program 3 times [2018-06-26 22:00:35,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:35,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:35,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:35,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:00:35,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:35,231 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:35,434 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:35,434 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:35,434 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:35,443 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 22:00:35,523 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 22:00:35,523 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:35,526 INFO ]: Computing forward predicates... [2018-06-26 22:00:44,000 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:01:04,337 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:01:04,357 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:01:04,357 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 22:01:04,357 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:01:04,357 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:01:04,357 INFO ]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:01:04,357 INFO ]: Start difference. First operand 11 states and 32 transitions. Second operand 7 states. [2018-06-26 22:01:04,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:01:04,556 INFO ]: Finished difference Result 24 states and 45 transitions. [2018-06-26 22:01:04,556 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:01:04,557 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 22:01:04,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:01:04,557 INFO ]: With dead ends: 24 [2018-06-26 22:01:04,557 INFO ]: Without dead ends: 24 [2018-06-26 22:01:04,557 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:01:04,557 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 22:01:04,559 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 11. [2018-06-26 22:01:04,559 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 22:01:04,559 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2018-06-26 22:01:04,560 INFO ]: Start accepts. Automaton has 11 states and 32 transitions. Word has length 8 [2018-06-26 22:01:04,560 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:01:04,560 INFO ]: Abstraction has 11 states and 32 transitions. [2018-06-26 22:01:04,560 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:01:04,560 INFO ]: Start isEmpty. Operand 11 states and 32 transitions. [2018-06-26 22:01:04,560 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 22:01:04,560 INFO ]: Found error trace [2018-06-26 22:01:04,560 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 22:01:04,560 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:01:04,560 INFO ]: Analyzing trace with hash -548105459, now seen corresponding path program 1 times [2018-06-26 22:01:04,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:01:04,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:01:04,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:01:04,563 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:01:04,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:01:04,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:01:04,878 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:01:04,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:01:04,879 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:01:04,885 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:01:04,993 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:01:04,997 INFO ]: Computing forward predicates... [2018-06-26 22:01:05,963 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:01:05,987 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 22:01:05,995 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:01:16,780 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:01:16,800 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:01:16,800 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 22:01:16,801 INFO ]: Interpolant automaton has 7 states [2018-06-26 22:01:16,801 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 22:01:16,801 INFO ]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 22:01:16,801 INFO ]: Start difference. First operand 11 states and 32 transitions. Second operand 7 states. [2018-06-26 22:01:17,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:01:17,010 INFO ]: Finished difference Result 23 states and 44 transitions. [2018-06-26 22:01:17,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:01:17,010 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 22:01:17,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:01:17,010 INFO ]: With dead ends: 23 [2018-06-26 22:01:17,010 INFO ]: Without dead ends: 23 [2018-06-26 22:01:17,011 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-06-26 22:01:17,011 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 22:01:17,012 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 11. [2018-06-26 22:01:17,012 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 22:01:17,013 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2018-06-26 22:01:17,013 INFO ]: Start accepts. Automaton has 11 states and 32 transitions. Word has length 8 [2018-06-26 22:01:17,013 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:01:17,013 INFO ]: Abstraction has 11 states and 32 transitions. [2018-06-26 22:01:17,013 INFO ]: Interpolant automaton has 7 states. [2018-06-26 22:01:17,013 INFO ]: Start isEmpty. Operand 11 states and 32 transitions. [2018-06-26 22:01:17,013 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 22:01:17,013 INFO ]: Found error trace [2018-06-26 22:01:17,013 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 22:01:17,013 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:01:17,013 INFO ]: Analyzing trace with hash -746369482, now seen corresponding path program 2 times [2018-06-26 22:01:17,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:01:17,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:01:17,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:01:17,014 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:01:17,014 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:01:17,073 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:01:17,418 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:01:17,418 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:01:17,418 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:01:17,450 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:01:17,557 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:01:17,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:01:17,562 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 22:01:21,953 INFO ]: Timeout while computing interpolants [2018-06-26 22:01:22,171 WARN ]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:01:22,171 WARN ]: Verification canceled [2018-06-26 22:01:22,173 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:01:22,174 WARN ]: Timeout [2018-06-26 22:01:22,174 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:01:22 BasicIcfg [2018-06-26 22:01:22,174 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:01:22,175 INFO ]: Toolchain (without parser) took 63709.97 ms. Allocated memory was 305.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 237.1 MB in the beginning and 1.2 GB in the end (delta: -969.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,176 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:01:22,176 INFO ]: ChcToBoogie took 68.78 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 232.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,176 INFO ]: Boogie Preprocessor took 89.52 ms. Allocated memory is still 305.7 MB. Free memory was 232.1 MB in the beginning and 230.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,177 INFO ]: RCFGBuilder took 410.74 ms. Allocated memory is still 305.7 MB. Free memory was 230.1 MB in the beginning and 204.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,177 INFO ]: BlockEncodingV2 took 608.11 ms. Allocated memory was 305.7 MB in the beginning and 327.2 MB in the end (delta: 21.5 MB). Free memory was 204.9 MB in the beginning and 267.5 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,178 INFO ]: TraceAbstraction took 62521.88 ms. Allocated memory was 327.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.9 MB in the beginning and 1.2 GB in the end (delta: -940.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 22:01:22,181 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, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 68.78 ms. Allocated memory is still 305.7 MB. Free memory was 236.1 MB in the beginning and 232.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 89.52 ms. Allocated memory is still 305.7 MB. Free memory was 232.1 MB in the beginning and 230.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 410.74 ms. Allocated memory is still 305.7 MB. Free memory was 230.1 MB in the beginning and 204.9 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 608.11 ms. Allocated memory was 305.7 MB in the beginning and 327.2 MB in the end (delta: 21.5 MB). Free memory was 204.9 MB in the beginning and 267.5 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62521.88 ms. Allocated memory was 327.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 265.9 MB in the beginning and 1.2 GB in the end (delta: -940.7 MB). Peak memory consumption was 1.3 GB. 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 10 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 26 quantified variables from 16 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 62.4s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 313 SDtfs, 0 SDslu, 93 SDs, 0 SdLazy, 333 SolverSat, 386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 3065 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2995 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 0/58 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/svd-some-loop.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-01-22-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd-some-loop.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-01-22-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd-some-loop.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-01-22-194.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd-some-loop.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-01-22-194.csv Completed graceful shutdown