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/ex8_e7_55.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:46:04,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:46:04,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:46:04,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:46:04,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:46:04,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:46:04,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:46:04,814 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:46:04,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:46:04,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:46:04,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:46:04,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:46:04,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:46:04,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:46:04,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:46:04,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:46:04,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:46:04,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:46:04,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:46:04,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:46:04,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:46:04,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:46:04,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:46:04,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:46:04,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:46:04,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:46:04,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:46:04,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:46:04,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:46:04,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:46:04,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:46:04,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:46:04,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:46:04,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:46:04,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:46:04,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:46:04,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:46:04,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:46:04,877 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:46:04,877 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:46:04,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:46:04,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:46:04,878 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:46:04,878 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:46:04,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:46:04,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:46:04,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:46:04,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:46:04,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:46:04,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:46:04,880 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:46:04,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:46:04,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:46:04,881 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:46:04,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:46:04,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:46:04,882 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:46:04,883 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:46:04,883 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:46:04,932 INFO ]: Repository-Root is: /tmp [2018-06-25 03:46:04,949 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:46:04,954 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:46:04,955 INFO ]: Initializing SmtParser... [2018-06-25 03:46:04,955 INFO ]: SmtParser initialized [2018-06-25 03:46:04,956 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 [2018-06-25 03:46:04,957 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 03:46:05,045 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 unknown [2018-06-25 03:46:05,311 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex8_e7_55.smt2 [2018-06-25 03:46:05,315 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:46:05,328 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:46:05,329 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:46:05,329 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:46:05,329 INFO ]: ChcToBoogie initialized [2018-06-25 03:46:05,335 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,396 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05 Unit [2018-06-25 03:46:05,396 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:46:05,397 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:46:05,397 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:46:05,397 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:46:05,417 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,418 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,426 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,426 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,437 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,438 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,448 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,450 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:46:05,451 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:46:05,451 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:46:05,451 INFO ]: RCFGBuilder initialized [2018-06-25 03:46:05,452 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (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-25 03:46:05,476 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:46:05,476 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:46:05,476 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:46:05,476 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:46:05,476 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:46:05,476 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-25 03:46:05,820 INFO ]: Using library mode [2018-06-25 03:46:05,821 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:05 BoogieIcfgContainer [2018-06-25 03:46:05,821 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:46:05,822 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:46:05,822 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:46:05,823 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:46:05,823 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:05" (1/1) ... [2018-06-25 03:46:05,842 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:46:05,844 INFO ]: Using Remove infeasible edges [2018-06-25 03:46:05,844 INFO ]: Using Maximize final states [2018-06-25 03:46:05,844 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:46:05,845 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:46:05,848 INFO ]: Using Remove sink states [2018-06-25 03:46:05,848 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:46:05,848 INFO ]: Using Use SBE [2018-06-25 03:46:05,857 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:46:07,985 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:07,986 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:46:08,473 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:46:08,474 INFO ]: SBE split 2 edges [2018-06-25 03:46:08,490 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:46:08,495 INFO ]: 0 new accepting states [2018-06-25 03:46:21,357 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 03:46:21,360 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:21,373 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 03:46:21,375 INFO ]: 0 new accepting states [2018-06-25 03:46:21,377 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:21,377 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:21,385 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:46:21,386 INFO ]: 0 new accepting states [2018-06-25 03:46:21,388 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:46:21,389 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:46:21,398 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 03:46:21,398 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:21 BasicIcfg [2018-06-25 03:46:21,398 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:46:21,399 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:46:21,400 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:46:21,403 INFO ]: TraceAbstraction initialized [2018-06-25 03:46:21,403 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:46:05" (1/4) ... [2018-06-25 03:46:21,404 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:46:21, skipping insertion in model container [2018-06-25 03:46:21,404 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:46:05" (2/4) ... [2018-06-25 03:46:21,404 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:46:21, skipping insertion in model container [2018-06-25 03:46:21,404 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:46:05" (3/4) ... [2018-06-25 03:46:21,404 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:21, skipping insertion in model container [2018-06-25 03:46:21,405 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:46:21" (4/4) ... [2018-06-25 03:46:21,406 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:46:21,416 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:46:21,425 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:46:21,481 INFO ]: Using default assertion order modulation [2018-06-25 03:46:21,481 INFO ]: Interprodecural is true [2018-06-25 03:46:21,481 INFO ]: Hoare is false [2018-06-25 03:46:21,481 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:46:21,481 INFO ]: Backedges is TWOTRACK [2018-06-25 03:46:21,481 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:46:21,481 INFO ]: Difference is false [2018-06-25 03:46:21,481 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:46:21,481 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:46:21,506 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:46:21,530 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:46:21,531 INFO ]: Found error trace [2018-06-25 03:46:21,531 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:46:21,532 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:21,537 INFO ]: Analyzing trace with hash 161073493, now seen corresponding path program 1 times [2018-06-25 03:46:21,539 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:21,540 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:21,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:21,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:21,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:21,636 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:21,740 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:21,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:21,742 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:21,744 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:21,758 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:21,759 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:21,761 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:46:24,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:24,839 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 03:46:24,839 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:24,840 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:46:24,840 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:24,860 INFO ]: With dead ends: 7 [2018-06-25 03:46:24,860 INFO ]: Without dead ends: 7 [2018-06-25 03:46:24,862 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 03:46:24,890 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:24,960 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:24,961 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:24,966 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 03:46:24,967 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 03:46:24,968 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:24,968 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 03:46:24,968 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:24,968 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 03:46:24,970 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:24,970 INFO ]: Found error trace [2018-06-25 03:46:24,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:24,971 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:24,971 INFO ]: Analyzing trace with hash 579668008, now seen corresponding path program 1 times [2018-06-25 03:46:24,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:24,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:24,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:24,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:24,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:25,006 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:25,117 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:25,117 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:25,117 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:25,118 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:25,118 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:25,118 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:25,119 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 03:46:27,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:27,809 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 03:46:27,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:27,810 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:27,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:27,812 INFO ]: With dead ends: 8 [2018-06-25 03:46:27,812 INFO ]: Without dead ends: 7 [2018-06-25 03:46:27,813 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 03:46:27,813 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:27,823 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:27,824 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:27,827 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2018-06-25 03:46:27,827 INFO ]: Start accepts. Automaton has 7 states and 1544 transitions. Word has length 6 [2018-06-25 03:46:27,827 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:27,827 INFO ]: Abstraction has 7 states and 1544 transitions. [2018-06-25 03:46:27,827 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:27,827 INFO ]: Start isEmpty. Operand 7 states and 1544 transitions. [2018-06-25 03:46:27,828 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:27,828 INFO ]: Found error trace [2018-06-25 03:46:27,828 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:27,828 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:27,828 INFO ]: Analyzing trace with hash 581515050, now seen corresponding path program 1 times [2018-06-25 03:46:27,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:27,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:27,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:27,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:27,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:27,855 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:27,886 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:27,887 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:27,887 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:27,887 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:27,887 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:27,887 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:27,887 INFO ]: Start difference. First operand 7 states and 1544 transitions. Second operand 3 states. [2018-06-25 03:46:30,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:30,030 INFO ]: Finished difference Result 8 states and 1544 transitions. [2018-06-25 03:46:30,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:30,030 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:30,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:30,032 INFO ]: With dead ends: 8 [2018-06-25 03:46:30,032 INFO ]: Without dead ends: 7 [2018-06-25 03:46:30,033 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 03:46:30,033 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:30,044 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:30,044 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:30,047 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1160 transitions. [2018-06-25 03:46:30,047 INFO ]: Start accepts. Automaton has 7 states and 1160 transitions. Word has length 6 [2018-06-25 03:46:30,047 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:30,047 INFO ]: Abstraction has 7 states and 1160 transitions. [2018-06-25 03:46:30,047 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:30,047 INFO ]: Start isEmpty. Operand 7 states and 1160 transitions. [2018-06-25 03:46:30,049 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:30,049 INFO ]: Found error trace [2018-06-25 03:46:30,049 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:30,049 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:30,049 INFO ]: Analyzing trace with hash 582438571, now seen corresponding path program 1 times [2018-06-25 03:46:30,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:30,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:30,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:30,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:30,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:30,086 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:30,213 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:30,213 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:30,213 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:30,213 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:30,213 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:30,213 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:30,213 INFO ]: Start difference. First operand 7 states and 1160 transitions. Second operand 3 states. [2018-06-25 03:46:31,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:31,252 INFO ]: Finished difference Result 8 states and 1160 transitions. [2018-06-25 03:46:31,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:31,252 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:31,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:31,254 INFO ]: With dead ends: 8 [2018-06-25 03:46:31,254 INFO ]: Without dead ends: 7 [2018-06-25 03:46:31,254 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 03:46:31,254 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:31,262 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:31,262 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:31,263 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 03:46:31,263 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 03:46:31,264 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:31,264 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 03:46:31,264 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:31,264 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 03:46:31,264 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:31,264 INFO ]: Found error trace [2018-06-25 03:46:31,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:31,264 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:31,264 INFO ]: Analyzing trace with hash 583362092, now seen corresponding path program 1 times [2018-06-25 03:46:31,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:31,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:31,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:31,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:31,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:31,297 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:31,352 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:31,352 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:31,352 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:31,352 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:31,352 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:31,352 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:31,353 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 03:46:32,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:32,001 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 03:46:32,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:32,002 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:32,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:32,003 INFO ]: With dead ends: 8 [2018-06-25 03:46:32,003 INFO ]: Without dead ends: 7 [2018-06-25 03:46:32,003 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 03:46:32,003 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:32,007 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:32,007 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:32,008 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 584 transitions. [2018-06-25 03:46:32,008 INFO ]: Start accepts. Automaton has 7 states and 584 transitions. Word has length 6 [2018-06-25 03:46:32,008 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:32,008 INFO ]: Abstraction has 7 states and 584 transitions. [2018-06-25 03:46:32,008 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:32,009 INFO ]: Start isEmpty. Operand 7 states and 584 transitions. [2018-06-25 03:46:32,009 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:32,009 INFO ]: Found error trace [2018-06-25 03:46:32,009 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:32,009 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:32,009 INFO ]: Analyzing trace with hash 585209134, now seen corresponding path program 1 times [2018-06-25 03:46:32,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:32,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:32,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:32,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,034 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:32,061 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:32,061 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:32,061 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:32,061 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:32,061 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:32,061 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:32,061 INFO ]: Start difference. First operand 7 states and 584 transitions. Second operand 3 states. [2018-06-25 03:46:32,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:32,524 INFO ]: Finished difference Result 8 states and 584 transitions. [2018-06-25 03:46:32,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:32,525 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:32,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:32,525 INFO ]: With dead ends: 8 [2018-06-25 03:46:32,525 INFO ]: Without dead ends: 7 [2018-06-25 03:46:32,526 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 03:46:32,526 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:32,528 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:32,529 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:32,529 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 392 transitions. [2018-06-25 03:46:32,529 INFO ]: Start accepts. Automaton has 7 states and 392 transitions. Word has length 6 [2018-06-25 03:46:32,530 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:32,530 INFO ]: Abstraction has 7 states and 392 transitions. [2018-06-25 03:46:32,530 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:32,530 INFO ]: Start isEmpty. Operand 7 states and 392 transitions. [2018-06-25 03:46:32,530 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:32,530 INFO ]: Found error trace [2018-06-25 03:46:32,530 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:32,530 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:32,530 INFO ]: Analyzing trace with hash 107748777, now seen corresponding path program 1 times [2018-06-25 03:46:32,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:32,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:32,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:32,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,551 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:32,621 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:32,621 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:32,621 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:32,621 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:32,621 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:32,621 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:32,621 INFO ]: Start difference. First operand 7 states and 392 transitions. Second operand 3 states. [2018-06-25 03:46:32,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:32,935 INFO ]: Finished difference Result 8 states and 392 transitions. [2018-06-25 03:46:32,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:32,938 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:32,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:32,939 INFO ]: With dead ends: 8 [2018-06-25 03:46:32,939 INFO ]: Without dead ends: 7 [2018-06-25 03:46:32,939 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 03:46:32,939 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:32,941 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:32,941 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:32,942 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2018-06-25 03:46:32,942 INFO ]: Start accepts. Automaton has 7 states and 264 transitions. Word has length 6 [2018-06-25 03:46:32,942 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:32,942 INFO ]: Abstraction has 7 states and 264 transitions. [2018-06-25 03:46:32,942 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:32,942 INFO ]: Start isEmpty. Operand 7 states and 264 transitions. [2018-06-25 03:46:32,942 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:32,942 INFO ]: Found error trace [2018-06-25 03:46:32,942 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:32,942 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:32,943 INFO ]: Analyzing trace with hash 110519340, now seen corresponding path program 1 times [2018-06-25 03:46:32,943 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:32,943 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:32,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:32,943 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:32,953 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:33,014 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:33,015 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:33,015 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:33,015 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:33,015 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:33,015 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:33,015 INFO ]: Start difference. First operand 7 states and 264 transitions. Second operand 3 states. [2018-06-25 03:46:33,222 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:33,222 INFO ]: Finished difference Result 8 states and 264 transitions. [2018-06-25 03:46:33,222 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:33,222 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:33,222 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:33,222 INFO ]: With dead ends: 8 [2018-06-25 03:46:33,222 INFO ]: Without dead ends: 7 [2018-06-25 03:46:33,223 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 03:46:33,223 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:46:33,224 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:46:33,224 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:46:33,225 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2018-06-25 03:46:33,225 INFO ]: Start accepts. Automaton has 7 states and 200 transitions. Word has length 6 [2018-06-25 03:46:33,225 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:33,225 INFO ]: Abstraction has 7 states and 200 transitions. [2018-06-25 03:46:33,225 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:33,225 INFO ]: Start isEmpty. Operand 7 states and 200 transitions. [2018-06-25 03:46:33,225 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:33,225 INFO ]: Found error trace [2018-06-25 03:46:33,225 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:33,225 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:33,225 INFO ]: Analyzing trace with hash -1074358103, now seen corresponding path program 1 times [2018-06-25 03:46:33,226 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:33,226 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:33,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:33,226 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:33,226 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:33,240 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:33,312 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:33,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:33,312 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 03:46:33,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:33,377 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:33,386 INFO ]: Computing forward predicates... [2018-06-25 03:46:34,536 WARN ]: Spent 458.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-06-25 03:46:34,546 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:34,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:34,572 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:46:34,572 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:46:34,572 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:46:34,572 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:46:34,572 INFO ]: Start difference. First operand 7 states and 200 transitions. Second operand 6 states. [2018-06-25 03:46:36,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:36,289 INFO ]: Finished difference Result 12 states and 207 transitions. [2018-06-25 03:46:36,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:46:36,289 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:46:36,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:36,290 INFO ]: With dead ends: 12 [2018-06-25 03:46:36,290 INFO ]: Without dead ends: 12 [2018-06-25 03:46:36,291 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:46:36,291 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 03:46:36,296 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-25 03:46:36,296 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 03:46:36,297 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2018-06-25 03:46:36,297 INFO ]: Start accepts. Automaton has 9 states and 204 transitions. Word has length 6 [2018-06-25 03:46:36,297 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:36,297 INFO ]: Abstraction has 9 states and 204 transitions. [2018-06-25 03:46:36,297 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:46:36,297 INFO ]: Start isEmpty. Operand 9 states and 204 transitions. [2018-06-25 03:46:36,297 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:36,297 INFO ]: Found error trace [2018-06-25 03:46:36,298 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:36,298 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:36,298 INFO ]: Analyzing trace with hash -1074356181, now seen corresponding path program 1 times [2018-06-25 03:46:36,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:36,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:36,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:36,298 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:36,298 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:36,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:36,432 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:36,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:36,432 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-25 03:46:36,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:36,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:36,465 INFO ]: Computing forward predicates... [2018-06-25 03:46:36,559 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:36,579 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:36,579 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:46:36,579 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:46:36,579 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:46:36,579 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:46:36,579 INFO ]: Start difference. First operand 9 states and 204 transitions. Second operand 6 states. [2018-06-25 03:46:37,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:37,354 INFO ]: Finished difference Result 13 states and 208 transitions. [2018-06-25 03:46:37,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 03:46:37,354 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:46:37,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:37,355 INFO ]: With dead ends: 13 [2018-06-25 03:46:37,355 INFO ]: Without dead ends: 13 [2018-06-25 03:46:37,355 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 03:46:37,355 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 03:46:37,359 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-25 03:46:37,359 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:37,359 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2018-06-25 03:46:37,359 INFO ]: Start accepts. Automaton has 10 states and 205 transitions. Word has length 6 [2018-06-25 03:46:37,359 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:37,359 INFO ]: Abstraction has 10 states and 205 transitions. [2018-06-25 03:46:37,359 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:46:37,359 INFO ]: Start isEmpty. Operand 10 states and 205 transitions. [2018-06-25 03:46:37,360 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:37,360 INFO ]: Found error trace [2018-06-25 03:46:37,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:37,360 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:37,360 INFO ]: Analyzing trace with hash -127749078, now seen corresponding path program 1 times [2018-06-25 03:46:37,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:37,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:37,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,360 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:37,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,374 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:37,472 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:37,472 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:37,472 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:37,472 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:37,472 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:37,472 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:37,473 INFO ]: Start difference. First operand 10 states and 205 transitions. Second operand 3 states. [2018-06-25 03:46:37,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:37,809 INFO ]: Finished difference Result 12 states and 205 transitions. [2018-06-25 03:46:37,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:37,809 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:37,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:37,809 INFO ]: With dead ends: 12 [2018-06-25 03:46:37,809 INFO ]: Without dead ends: 10 [2018-06-25 03:46:37,810 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 03:46:37,810 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:37,811 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:37,811 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:37,811 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2018-06-25 03:46:37,811 INFO ]: Start accepts. Automaton has 10 states and 157 transitions. Word has length 6 [2018-06-25 03:46:37,811 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:37,811 INFO ]: Abstraction has 10 states and 157 transitions. [2018-06-25 03:46:37,811 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:37,811 INFO ]: Start isEmpty. Operand 10 states and 157 transitions. [2018-06-25 03:46:37,812 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:37,812 INFO ]: Found error trace [2018-06-25 03:46:37,812 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:37,812 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:37,812 INFO ]: Analyzing trace with hash -834242643, now seen corresponding path program 1 times [2018-06-25 03:46:37,812 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:37,812 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:37,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,812 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:37,812 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:37,861 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:37,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:37,861 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:37,861 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:37,861 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:37,861 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:37,861 INFO ]: Start difference. First operand 10 states and 157 transitions. Second operand 3 states. [2018-06-25 03:46:37,980 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:37,980 INFO ]: Finished difference Result 12 states and 157 transitions. [2018-06-25 03:46:37,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:37,983 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:37,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:37,983 INFO ]: With dead ends: 12 [2018-06-25 03:46:37,983 INFO ]: Without dead ends: 10 [2018-06-25 03:46:37,984 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 03:46:37,984 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:37,985 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:37,985 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:37,985 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2018-06-25 03:46:37,985 INFO ]: Start accepts. Automaton has 10 states and 121 transitions. Word has length 6 [2018-06-25 03:46:37,985 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:37,985 INFO ]: Abstraction has 10 states and 121 transitions. [2018-06-25 03:46:37,985 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:37,985 INFO ]: Start isEmpty. Operand 10 states and 121 transitions. [2018-06-25 03:46:37,986 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:37,986 INFO ]: Found error trace [2018-06-25 03:46:37,986 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:37,986 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:37,986 INFO ]: Analyzing trace with hash 349711279, now seen corresponding path program 1 times [2018-06-25 03:46:37,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:37,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:37,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:37,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:37,995 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:38,098 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:38,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:38,098 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:38,098 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:38,098 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:38,098 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:38,098 INFO ]: Start difference. First operand 10 states and 121 transitions. Second operand 3 states. [2018-06-25 03:46:38,221 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:38,221 INFO ]: Finished difference Result 12 states and 121 transitions. [2018-06-25 03:46:38,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:38,221 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:38,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:38,221 INFO ]: With dead ends: 12 [2018-06-25 03:46:38,221 INFO ]: Without dead ends: 10 [2018-06-25 03:46:38,222 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 03:46:38,222 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:38,223 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:38,223 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:38,224 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2018-06-25 03:46:38,224 INFO ]: Start accepts. Automaton has 10 states and 73 transitions. Word has length 6 [2018-06-25 03:46:38,224 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:38,224 INFO ]: Abstraction has 10 states and 73 transitions. [2018-06-25 03:46:38,224 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:38,224 INFO ]: Start isEmpty. Operand 10 states and 73 transitions. [2018-06-25 03:46:38,224 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:38,224 INFO ]: Found error trace [2018-06-25 03:46:38,224 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:38,224 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:38,224 INFO ]: Analyzing trace with hash -246883287, now seen corresponding path program 1 times [2018-06-25 03:46:38,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:38,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:38,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:38,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,239 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:38,277 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:38,277 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:38,277 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:38,277 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:38,277 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:38,277 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:38,277 INFO ]: Start difference. First operand 10 states and 73 transitions. Second operand 3 states. [2018-06-25 03:46:38,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:38,333 INFO ]: Finished difference Result 12 states and 73 transitions. [2018-06-25 03:46:38,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:38,333 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:38,333 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:38,333 INFO ]: With dead ends: 12 [2018-06-25 03:46:38,333 INFO ]: Without dead ends: 10 [2018-06-25 03:46:38,333 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 03:46:38,333 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:38,334 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:38,334 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:38,335 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2018-06-25 03:46:38,335 INFO ]: Start accepts. Automaton has 10 states and 53 transitions. Word has length 6 [2018-06-25 03:46:38,335 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:38,335 INFO ]: Abstraction has 10 states and 53 transitions. [2018-06-25 03:46:38,335 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:38,335 INFO ]: Start isEmpty. Operand 10 states and 53 transitions. [2018-06-25 03:46:38,335 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:38,335 INFO ]: Found error trace [2018-06-25 03:46:38,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:38,335 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:38,335 INFO ]: Analyzing trace with hash 165930600, now seen corresponding path program 1 times [2018-06-25 03:46:38,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:38,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:38,447 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:38,447 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:38,447 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:38,447 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:38,447 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:38,447 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:38,447 INFO ]: Start difference. First operand 10 states and 53 transitions. Second operand 3 states. [2018-06-25 03:46:38,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:38,981 INFO ]: Finished difference Result 11 states and 53 transitions. [2018-06-25 03:46:38,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:38,983 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:38,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:38,983 INFO ]: With dead ends: 11 [2018-06-25 03:46:38,983 INFO ]: Without dead ends: 10 [2018-06-25 03:46:38,983 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 03:46:38,983 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:38,984 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:38,984 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:38,985 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-06-25 03:46:38,985 INFO ]: Start accepts. Automaton has 10 states and 45 transitions. Word has length 6 [2018-06-25 03:46:38,985 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:38,985 INFO ]: Abstraction has 10 states and 45 transitions. [2018-06-25 03:46:38,985 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:38,985 INFO ]: Start isEmpty. Operand 10 states and 45 transitions. [2018-06-25 03:46:38,985 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:38,985 INFO ]: Found error trace [2018-06-25 03:46:38,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:38,985 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:38,985 INFO ]: Analyzing trace with hash -1251674135, now seen corresponding path program 1 times [2018-06-25 03:46:38,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:38,985 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:38,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,986 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:38,986 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:38,999 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:39,105 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:39,105 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:39,105 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:39,105 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:39,105 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:39,105 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:39,105 INFO ]: Start difference. First operand 10 states and 45 transitions. Second operand 3 states. [2018-06-25 03:46:39,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:39,542 INFO ]: Finished difference Result 11 states and 45 transitions. [2018-06-25 03:46:39,570 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:39,570 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:39,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:39,571 INFO ]: With dead ends: 11 [2018-06-25 03:46:39,571 INFO ]: Without dead ends: 10 [2018-06-25 03:46:39,571 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 03:46:39,571 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:39,572 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:39,572 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:39,572 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-06-25 03:46:39,572 INFO ]: Start accepts. Automaton has 10 states and 37 transitions. Word has length 6 [2018-06-25 03:46:39,572 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:39,572 INFO ]: Abstraction has 10 states and 37 transitions. [2018-06-25 03:46:39,572 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:39,572 INFO ]: Start isEmpty. Operand 10 states and 37 transitions. [2018-06-25 03:46:39,572 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:39,572 INFO ]: Found error trace [2018-06-25 03:46:39,572 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:39,572 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:39,572 INFO ]: Analyzing trace with hash -245959766, now seen corresponding path program 1 times [2018-06-25 03:46:39,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:39,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:39,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:39,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:39,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:39,585 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:39,690 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:39,690 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:46:39,690 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:46:39,690 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:46:39,691 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:46:39,691 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:46:39,691 INFO ]: Start difference. First operand 10 states and 37 transitions. Second operand 3 states. [2018-06-25 03:46:39,885 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:39,885 INFO ]: Finished difference Result 11 states and 37 transitions. [2018-06-25 03:46:39,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:46:39,885 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:46:39,886 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:39,886 INFO ]: With dead ends: 11 [2018-06-25 03:46:39,886 INFO ]: Without dead ends: 10 [2018-06-25 03:46:39,886 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 03:46:39,886 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:46:39,887 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 03:46:39,887 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:39,887 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-06-25 03:46:39,887 INFO ]: Start accepts. Automaton has 10 states and 29 transitions. Word has length 6 [2018-06-25 03:46:39,887 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:39,887 INFO ]: Abstraction has 10 states and 29 transitions. [2018-06-25 03:46:39,887 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:46:39,887 INFO ]: Start isEmpty. Operand 10 states and 29 transitions. [2018-06-25 03:46:39,887 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:39,887 INFO ]: Found error trace [2018-06-25 03:46:39,887 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:39,887 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:39,888 INFO ]: Analyzing trace with hash -273665396, now seen corresponding path program 1 times [2018-06-25 03:46:39,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:39,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:39,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:39,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:39,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:39,897 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:40,006 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:40,007 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:40,007 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-25 03:46:40,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:40,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:40,047 INFO ]: Computing forward predicates... [2018-06-25 03:46:40,266 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:40,285 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:40,285 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 03:46:40,286 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:46:40,286 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:46:40,286 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:46:40,286 INFO ]: Start difference. First operand 10 states and 29 transitions. Second operand 6 states. [2018-06-25 03:46:40,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:40,332 INFO ]: Finished difference Result 16 states and 37 transitions. [2018-06-25 03:46:40,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:46:40,332 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-25 03:46:40,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:40,332 INFO ]: With dead ends: 16 [2018-06-25 03:46:40,332 INFO ]: Without dead ends: 16 [2018-06-25 03:46:40,333 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:46:40,333 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 03:46:40,334 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-25 03:46:40,334 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 03:46:40,334 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2018-06-25 03:46:40,334 INFO ]: Start accepts. Automaton has 12 states and 33 transitions. Word has length 6 [2018-06-25 03:46:40,334 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:40,334 INFO ]: Abstraction has 12 states and 33 transitions. [2018-06-25 03:46:40,334 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:46:40,334 INFO ]: Start isEmpty. Operand 12 states and 33 transitions. [2018-06-25 03:46:40,334 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:40,334 INFO ]: Found error trace [2018-06-25 03:46:40,334 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:40,334 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:40,334 INFO ]: Analyzing trace with hash -273663474, now seen corresponding path program 1 times [2018-06-25 03:46:40,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:40,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:40,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:40,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:40,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:40,344 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:40,417 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:40,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:46:40,417 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-25 03:46:40,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:40,448 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:46:40,449 INFO ]: Computing forward predicates... [2018-06-25 03:46:40,631 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:46:40,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:46:40,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 03:46:40,651 INFO ]: Interpolant automaton has 5 states [2018-06-25 03:46:40,651 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 03:46:40,651 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:46:40,651 INFO ]: Start difference. First operand 12 states and 33 transitions. Second operand 5 states. [2018-06-25 03:46:40,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:46:40,736 INFO ]: Finished difference Result 18 states and 41 transitions. [2018-06-25 03:46:40,736 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:46:40,736 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-25 03:46:40,736 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:46:40,736 INFO ]: With dead ends: 18 [2018-06-25 03:46:40,736 INFO ]: Without dead ends: 18 [2018-06-25 03:46:40,736 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:46:40,736 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 03:46:40,737 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 10. [2018-06-25 03:46:40,738 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 03:46:40,738 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-06-25 03:46:40,738 INFO ]: Start accepts. Automaton has 10 states and 29 transitions. Word has length 6 [2018-06-25 03:46:40,738 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:46:40,738 INFO ]: Abstraction has 10 states and 29 transitions. [2018-06-25 03:46:40,738 INFO ]: Interpolant automaton has 5 states. [2018-06-25 03:46:40,738 INFO ]: Start isEmpty. Operand 10 states and 29 transitions. [2018-06-25 03:46:40,738 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:46:40,738 INFO ]: Found error trace [2018-06-25 03:46:40,738 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:46:40,738 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:46:40,738 INFO ]: Analyzing trace with hash -893347987, now seen corresponding path program 1 times [2018-06-25 03:46:40,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:46:40,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:46:40,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:40,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:46:40,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:46:41,330 INFO ]: Conjunction of SSA is sat [2018-06-25 03:46:41,336 INFO ]: Counterexample might be feasible [2018-06-25 03:46:41,354 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:46:41,355 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:46:41 BasicIcfg [2018-06-25 03:46:41,355 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:46:41,356 INFO ]: Toolchain (without parser) took 36040.43 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 983.0 MB). Free memory was 261.6 MB in the beginning and 1.2 GB in the end (delta: -921.9 MB). Peak memory consumption was 61.1 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:41,357 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:46:41,358 INFO ]: ChcToBoogie took 67.71 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 258.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:41,360 INFO ]: Boogie Preprocessor took 53.30 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:41,360 INFO ]: RCFGBuilder took 370.44 ms. Allocated memory is still 309.3 MB. Free memory was 257.6 MB in the beginning and 243.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:41,361 INFO ]: BlockEncodingV2 took 15576.79 ms. Allocated memory was 309.3 MB in the beginning and 751.3 MB in the end (delta: 442.0 MB). Free memory was 243.7 MB in the beginning and 496.4 MB in the end (delta: -252.8 MB). Peak memory consumption was 424.4 MB. Max. memory is 3.6 GB. [2018-06-25 03:46:41,361 INFO ]: TraceAbstraction took 19955.98 ms. Allocated memory was 751.3 MB in the beginning and 1.3 GB in the end (delta: 541.1 MB). Free memory was 496.4 MB in the beginning and 1.2 GB in the end (delta: -687.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:46:41,364 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, 2055 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.71 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 258.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 53.30 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 257.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 370.44 ms. Allocated memory is still 309.3 MB. Free memory was 257.6 MB in the beginning and 243.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15576.79 ms. Allocated memory was 309.3 MB in the beginning and 751.3 MB in the end (delta: 442.0 MB). Free memory was 243.7 MB in the beginning and 496.4 MB in the end (delta: -252.8 MB). Peak memory consumption was 424.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19955.98 ms. Allocated memory was 751.3 MB in the beginning and 1.3 GB in the end (delta: 541.1 MB). Free memory was 496.4 MB in the beginning and 1.2 GB in the end (delta: -687.1 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assume !hbv_False_1_Bool; [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_False_2_Int, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Bool, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Bool, hbv_False_14_Bool, hbv_False_15_Int, hbv_False_16_Bool, hbv_False_17_Bool, hbv_False_18_Bool, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_21_Bool; [L0] havoc hbv_False_5_Bool, hbv_False_17_Bool, hbv_False_4_Bool, hbv_False_8_Int, hbv_False_16_Bool, hbv_False_11_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_6_Int, hbv_False_13_Bool, hbv_False_3_Bool, hbv_False_21_Bool, hbv_False_14_Bool, hbv_False_12_Int, hbv_False_19_Bool, hbv_False_1_Bool, hbv_False_20_Bool, hbv_False_15_Int, hbv_False_2_Int, hbv_False_18_Bool, hbv_False_7_Int; [L0] assume ((((((((((((((((((((((((((((((((((((((!(((hbv_state_2_Bool && !hhv_state_17_Bool) || hhv_state_3_Bool) && ((!hhv_state_3_Bool || !hbv_state_2_Bool) || hhv_state_17_Bool)) && !((hbv_state_9_Bool && !hbv_state_10_Bool) && !(hbv_state_15_Int == 2))) && !((!hbv_state_11_Bool || !hbv_state_12_Bool) && (hbv_state_11_Bool || hbv_state_12_Bool))) && !((!(hbv_state_8_Int == hbv_state_6_Int) && !hbv_state_10_Bool) && !hbv_state_9_Bool)) && !(!(hbv_state_15_Int == 0) && (hbv_state_10_Bool || !hbv_state_9_Bool))) && !((!hbv_state_18_Bool || !hbv_state_1_Bool) && (hbv_state_1_Bool || hbv_state_18_Bool))) && hhv_state_7_Int == hhv_state_10_Int) && !((hbv_state_3_Bool || hbv_state_13_Bool) && (!hbv_state_3_Bool || !hbv_state_13_Bool))) && hbv_state_16_Int == hbv_state_8_Int) && hbv_state_14_Int == hbv_state_7_Int) && hbv_state_4_Int == hbv_state_5_Int) && hhv_state_4_Int == hhv_state_7_Int) && hbv_state_16_Int == hbv_state_4_Int) && hbv_state_19_Int == hbv_state_6_Int) && hhv_state_6_Int == hhv_state_0_Int) && !((!hhv_state_16_Bool || !hhv_state_11_Bool) && (hhv_state_16_Bool || hhv_state_11_Bool))) && !((!(hhv_state_8_Int == hhv_state_13_Int) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && hhv_state_5_Int == hhv_state_4_Int) && !((!hhv_state_18_Bool || !hhv_state_3_Bool) && (hhv_state_3_Bool || hhv_state_18_Bool))) && !(!(hhv_state_13_Int == 0) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((hhv_state_1_Bool || hhv_state_12_Bool) && (!hhv_state_1_Bool || !hhv_state_12_Bool))) && hhv_state_9_Int == hhv_state_8_Int) && !((hbv_state_1_Bool || hbv_state_17_Bool) && (!hbv_state_17_Bool || !hbv_state_1_Bool))) && !(((hhv_state_19_Bool || 10 <= hhv_state_10_Int) && !hbv_state_3_Bool) && (!hhv_state_19_Bool || !(10 <= hhv_state_10_Int)))) && !(((!(hhv_state_10_Int <= -10) || !hhv_state_20_Bool) && (hhv_state_20_Bool || hhv_state_10_Int <= -10)) && !hbv_state_1_Bool)) && !(!(hhv_state_8_Int == 1) && (!hhv_state_14_Bool || hhv_state_15_Bool))) && !((!hhv_state_12_Bool || !hhv_state_17_Bool) && (hhv_state_17_Bool || hhv_state_12_Bool))) && hbv_state_4_Int == hhv_state_0_Int) && !(((!(hhv_state_10_Int <= 0) || hhv_state_19_Bool) && hbv_state_3_Bool) && (hhv_state_10_Int <= 0 || !hhv_state_19_Bool))) && !(((hhv_state_20_Bool || !(0 <= hhv_state_10_Int)) && hbv_state_1_Bool) && (0 <= hhv_state_10_Int || !hhv_state_20_Bool))) && !((hbv_state_9_Bool && !hbv_state_10_Bool) && !(hbv_state_14_Int == hbv_state_15_Int))) && !((!hhv_state_2_Bool || !hhv_state_11_Bool) && (hhv_state_11_Bool || hhv_state_2_Bool))) && !(!(hbv_state_8_Int + (-1 * hbv_state_6_Int + -1 * hbv_state_7_Int) == 0) && (hbv_state_9_Bool || hbv_state_10_Bool))) && !((!(hhv_state_13_Int == 2) && !hhv_state_15_Bool) && hhv_state_14_Bool)) && !((!hhv_state_15_Bool && !(hhv_state_5_Int == hhv_state_6_Int)) && !hhv_state_14_Bool)) && !((!hhv_state_19_Bool || !hhv_state_2_Bool) && (hhv_state_2_Bool || hhv_state_19_Bool))) && !((hhv_state_14_Bool || hhv_state_15_Bool) && !(hhv_state_5_Int + (-1 * hhv_state_6_Int + -1 * hhv_state_9_Int) == 0))) && !(!(hbv_state_14_Int == 1) && (hbv_state_10_Bool || !hbv_state_9_Bool))) && !((hhv_state_20_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_20_Bool))) && !((hbv_state_2_Bool || hbv_state_3_Bool) && (!hbv_state_3_Bool || !hbv_state_2_Bool)); [L0] hhv_state_0_Int, hhv_state_1_Bool, hhv_state_2_Bool, hhv_state_3_Bool, hhv_state_4_Int, hhv_state_5_Int, hhv_state_6_Int, hhv_state_7_Int, hhv_state_8_Int, hhv_state_9_Int, hhv_state_10_Int, hhv_state_11_Bool, hhv_state_12_Bool, hhv_state_13_Int, hhv_state_14_Bool, hhv_state_15_Bool, hhv_state_16_Bool, hhv_state_17_Bool, hhv_state_18_Bool, hhv_state_19_Bool, hhv_state_20_Bool := hbv_state_19_Int, hbv_state_18_Bool, hbv_state_13_Bool, hbv_state_11_Bool, hbv_state_16_Int, hbv_state_8_Int, hbv_state_6_Int, hbv_state_4_Int, hbv_state_14_Int, hbv_state_7_Int, hbv_state_5_Int, hbv_state_3_Bool, hbv_state_1_Bool, hbv_state_15_Int, hbv_state_9_Bool, hbv_state_10_Bool, hbv_state_2_Bool, hbv_state_17_Bool, hbv_state_12_Bool, hbv_state_20_Bool, hbv_state_21_Bool; [L0] havoc hbv_state_15_Int, hbv_state_9_Bool, hbv_state_10_Bool, hbv_state_6_Int, hbv_state_8_Int, hbv_state_4_Int, hbv_state_11_Bool, hbv_state_21_Bool, hbv_state_14_Int, hbv_state_17_Bool, hbv_state_5_Int, hbv_state_2_Bool, hbv_state_19_Int, hbv_state_20_Bool, hbv_state_7_Int, hbv_state_13_Bool, hbv_state_18_Bool, hbv_state_12_Bool, hbv_state_16_Int, hbv_state_1_Bool, hbv_state_3_Bool; [L0] RET call gotoProc(0, 0, false, false, false, 0, 0, 0, 0, 0, 0, 0, false, false, 0, false, false, false, false, false, false, false); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. UNSAFE Result, 19.8s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 15.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9910 SDtfs, 4 SDslu, 87 SDs, 0 SdLazy, 6478 SolverSat, 4490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=18, 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, 19 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1395 SizeOfPredicates, 14 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 14/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-46-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-46-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-46-41-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex8_e7_55.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-46-41-374.csv Received shutdown request...