java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:03:03,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:03:03,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:03:03,587 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:03:03,588 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:03:03,589 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:03:03,590 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:03:03,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:03:03,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:03:03,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:03:03,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:03:03,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:03:03,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:03:03,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:03:03,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:03:03,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:03:03,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:03:03,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:03:03,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:03:03,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:03:03,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:03:03,619 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:03:03,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:03:03,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:03:03,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:03:03,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:03:03,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:03:03,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:03:03,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:03:03,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:03:03,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:03:03,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:03:03,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:03:03,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:03:03,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:03:03,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:03:03,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:03:03,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:03:03,654 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:03:03,656 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:03:03,657 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:03:03,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:03:03,658 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:03:03,658 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:03:03,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:03:03,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:03:03,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:03:03,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:03:03,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:03:03,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:03:03,659 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:03:03,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:03:03,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:03:03,661 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:03:03,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:03:03,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:03:03,661 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:03:03,663 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:03:03,663 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:03:03,714 INFO ]: Repository-Root is: /tmp [2018-06-24 21:03:03,732 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:03:03,737 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:03:03,739 INFO ]: Initializing SmtParser... [2018-06-24 21:03:03,739 INFO ]: SmtParser initialized [2018-06-24 21:03:03,740 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-24 21:03:03,741 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:03:03,823 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 unknown [2018-06-24 21:03:04,106 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/011b-horn.smt2 [2018-06-24 21:03:04,110 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:03:04,119 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:03:04,120 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:03:04,120 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:03:04,120 INFO ]: ChcToBoogie initialized [2018-06-24 21:03:04,123 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,181 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04 Unit [2018-06-24 21:03:04,181 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:03:04,181 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:03:04,181 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:03:04,181 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:03:04,203 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,203 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,211 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,211 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,225 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,236 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,238 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,240 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:03:04,240 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:03:04,240 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:03:04,240 INFO ]: RCFGBuilder initialized [2018-06-24 21:03:04,241 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:03:04,268 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:03:04,268 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:03:04,268 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:03:04,268 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:03:04,268 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:03:04,268 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-24 21:03:04,877 INFO ]: Using library mode [2018-06-24 21:03:04,877 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:04 BoogieIcfgContainer [2018-06-24 21:03:04,877 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:03:04,878 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:03:04,878 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:03:04,879 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:03:04,880 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:04" (1/1) ... [2018-06-24 21:03:04,898 INFO ]: Initial Icfg 12 locations, 43 edges [2018-06-24 21:03:04,900 INFO ]: Using Remove infeasible edges [2018-06-24 21:03:04,900 INFO ]: Using Maximize final states [2018-06-24 21:03:04,901 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:03:04,901 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:03:04,904 INFO ]: Using Remove sink states [2018-06-24 21:03:04,905 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:03:04,905 INFO ]: Using Use SBE [2018-06-24 21:03:04,925 INFO ]: SBE split 0 edges [2018-06-24 21:03:04,935 INFO ]: Removed 9 edges and 2 locations because of local infeasibility [2018-06-24 21:03:04,937 INFO ]: 0 new accepting states [2018-06-24 21:03:05,012 INFO ]: Removed 15 edges and 2 locations by large block encoding [2018-06-24 21:03:05,014 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:03:05,016 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:03:05,016 INFO ]: 0 new accepting states [2018-06-24 21:03:05,016 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:03:05,016 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:03:05,016 INFO ]: Encoded RCFG 8 locations, 32 edges [2018-06-24 21:03:05,018 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:03:05 BasicIcfg [2018-06-24 21:03:05,018 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:03:05,019 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:03:05,019 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:03:05,023 INFO ]: TraceAbstraction initialized [2018-06-24 21:03:05,023 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:03:04" (1/4) ... [2018-06-24 21:03:05,024 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:03:05, skipping insertion in model container [2018-06-24 21:03:05,024 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:03:04" (2/4) ... [2018-06-24 21:03:05,024 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:03:05, skipping insertion in model container [2018-06-24 21:03:05,025 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:03:04" (3/4) ... [2018-06-24 21:03:05,025 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12be4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:03:05, skipping insertion in model container [2018-06-24 21:03:05,025 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:03:05" (4/4) ... [2018-06-24 21:03:05,029 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:03:05,040 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:03:05,048 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:03:05,105 INFO ]: Using default assertion order modulation [2018-06-24 21:03:05,105 INFO ]: Interprodecural is true [2018-06-24 21:03:05,105 INFO ]: Hoare is false [2018-06-24 21:03:05,105 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:03:05,105 INFO ]: Backedges is TWOTRACK [2018-06-24 21:03:05,105 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:03:05,105 INFO ]: Difference is false [2018-06-24 21:03:05,106 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:03:05,106 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:03:05,119 INFO ]: Start isEmpty. Operand 8 states. [2018-06-24 21:03:05,139 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:05,139 INFO ]: Found error trace [2018-06-24 21:03:05,140 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:05,140 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:05,148 INFO ]: Analyzing trace with hash 53045641, now seen corresponding path program 1 times [2018-06-24 21:03:05,150 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:05,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:05,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:05,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:05,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:05,243 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:05,324 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:05,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:05,325 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:05,327 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:05,339 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:05,340 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:05,343 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-24 21:03:05,648 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:05,648 INFO ]: Finished difference Result 9 states and 32 transitions. [2018-06-24 21:03:05,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:05,649 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:05,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:05,658 INFO ]: With dead ends: 9 [2018-06-24 21:03:05,658 INFO ]: Without dead ends: 8 [2018-06-24 21:03:05,660 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:05,673 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:03:05,692 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:03:05,694 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:05,695 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-06-24 21:03:05,696 INFO ]: Start accepts. Automaton has 8 states and 29 transitions. Word has length 5 [2018-06-24 21:03:05,698 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:05,698 INFO ]: Abstraction has 8 states and 29 transitions. [2018-06-24 21:03:05,698 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:05,698 INFO ]: Start isEmpty. Operand 8 states and 29 transitions. [2018-06-24 21:03:05,698 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:05,698 INFO ]: Found error trace [2018-06-24 21:03:05,698 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:05,699 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:05,699 INFO ]: Analyzing trace with hash 53075432, now seen corresponding path program 1 times [2018-06-24 21:03:05,699 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:05,699 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:05,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:05,700 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:05,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:05,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:05,792 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:05,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:05,792 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:05,794 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:05,794 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:05,794 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:05,794 INFO ]: Start difference. First operand 8 states and 29 transitions. Second operand 3 states. [2018-06-24 21:03:06,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,033 INFO ]: Finished difference Result 10 states and 30 transitions. [2018-06-24 21:03:06,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,034 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:06,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,036 INFO ]: With dead ends: 10 [2018-06-24 21:03:06,036 INFO ]: Without dead ends: 10 [2018-06-24 21:03:06,037 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,037 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:03:06,042 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-24 21:03:06,042 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:06,042 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-24 21:03:06,043 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 5 [2018-06-24 21:03:06,043 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,043 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-24 21:03:06,043 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,043 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-24 21:03:06,043 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:06,043 INFO ]: Found error trace [2018-06-24 21:03:06,043 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:06,043 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,043 INFO ]: Analyzing trace with hash 53076393, now seen corresponding path program 1 times [2018-06-24 21:03:06,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,063 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,135 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,135 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,135 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,136 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,136 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 3 states. [2018-06-24 21:03:06,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,202 INFO ]: Finished difference Result 11 states and 36 transitions. [2018-06-24 21:03:06,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,202 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:06,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,203 INFO ]: With dead ends: 11 [2018-06-24 21:03:06,203 INFO ]: Without dead ends: 11 [2018-06-24 21:03:06,203 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,203 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:06,206 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 21:03:06,206 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:03:06,206 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-06-24 21:03:06,206 INFO ]: Start accepts. Automaton has 9 states and 31 transitions. Word has length 5 [2018-06-24 21:03:06,206 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,206 INFO ]: Abstraction has 9 states and 31 transitions. [2018-06-24 21:03:06,206 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,206 INFO ]: Start isEmpty. Operand 9 states and 31 transitions. [2018-06-24 21:03:06,207 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:06,207 INFO ]: Found error trace [2018-06-24 21:03:06,207 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:06,207 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,207 INFO ]: Analyzing trace with hash 53107145, now seen corresponding path program 1 times [2018-06-24 21:03:06,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,217 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,309 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,309 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,309 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,309 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,309 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,310 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,310 INFO ]: Start difference. First operand 9 states and 31 transitions. Second operand 3 states. [2018-06-24 21:03:06,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,419 INFO ]: Finished difference Result 11 states and 35 transitions. [2018-06-24 21:03:06,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,419 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:06,419 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,420 INFO ]: With dead ends: 11 [2018-06-24 21:03:06,420 INFO ]: Without dead ends: 11 [2018-06-24 21:03:06,420 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,420 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:06,422 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:03:06,423 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:06,423 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-06-24 21:03:06,423 INFO ]: Start accepts. Automaton has 10 states and 34 transitions. Word has length 5 [2018-06-24 21:03:06,423 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,423 INFO ]: Abstraction has 10 states and 34 transitions. [2018-06-24 21:03:06,423 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,423 INFO ]: Start isEmpty. Operand 10 states and 34 transitions. [2018-06-24 21:03:06,424 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:03:06,424 INFO ]: Found error trace [2018-06-24 21:03:06,424 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:03:06,425 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,425 INFO ]: Analyzing trace with hash 53110028, now seen corresponding path program 1 times [2018-06-24 21:03:06,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,435 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,453 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,453 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,453 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,453 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,453 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,454 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,454 INFO ]: Start difference. First operand 10 states and 34 transitions. Second operand 3 states. [2018-06-24 21:03:06,475 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,475 INFO ]: Finished difference Result 11 states and 33 transitions. [2018-06-24 21:03:06,475 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,475 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:03:06,475 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,476 INFO ]: With dead ends: 11 [2018-06-24 21:03:06,476 INFO ]: Without dead ends: 11 [2018-06-24 21:03:06,476 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,476 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 21:03:06,478 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-24 21:03:06,478 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:06,478 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2018-06-24 21:03:06,479 INFO ]: Start accepts. Automaton has 10 states and 32 transitions. Word has length 5 [2018-06-24 21:03:06,479 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,479 INFO ]: Abstraction has 10 states and 32 transitions. [2018-06-24 21:03:06,479 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,479 INFO ]: Start isEmpty. Operand 10 states and 32 transitions. [2018-06-24 21:03:06,479 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:06,479 INFO ]: Found error trace [2018-06-24 21:03:06,479 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:06,479 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,479 INFO ]: Analyzing trace with hash 1644035918, now seen corresponding path program 1 times [2018-06-24 21:03:06,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,577 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,577 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,577 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:03:06,577 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:03:06,577 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:03:06,578 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:06,578 INFO ]: Start difference. First operand 10 states and 32 transitions. Second operand 4 states. [2018-06-24 21:03:06,756 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,756 INFO ]: Finished difference Result 17 states and 55 transitions. [2018-06-24 21:03:06,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 21:03:06,757 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 21:03:06,757 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,757 INFO ]: With dead ends: 17 [2018-06-24 21:03:06,757 INFO ]: Without dead ends: 13 [2018-06-24 21:03:06,757 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 21:03:06,757 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:03:06,759 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 21:03:06,759 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:06,759 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2018-06-24 21:03:06,759 INFO ]: Start accepts. Automaton has 10 states and 28 transitions. Word has length 6 [2018-06-24 21:03:06,760 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,760 INFO ]: Abstraction has 10 states and 28 transitions. [2018-06-24 21:03:06,760 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:03:06,760 INFO ]: Start isEmpty. Operand 10 states and 28 transitions. [2018-06-24 21:03:06,760 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:06,760 INFO ]: Found error trace [2018-06-24 21:03:06,760 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:06,760 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,760 INFO ]: Analyzing trace with hash 1644095500, now seen corresponding path program 1 times [2018-06-24 21:03:06,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,761 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,761 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,768 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,804 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,804 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,805 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,805 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,805 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,805 INFO ]: Start difference. First operand 10 states and 28 transitions. Second operand 3 states. [2018-06-24 21:03:06,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,818 INFO ]: Finished difference Result 10 states and 23 transitions. [2018-06-24 21:03:06,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,819 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:03:06,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,819 INFO ]: With dead ends: 10 [2018-06-24 21:03:06,819 INFO ]: Without dead ends: 10 [2018-06-24 21:03:06,820 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,820 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:03:06,821 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:03:06,821 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:03:06,821 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-06-24 21:03:06,821 INFO ]: Start accepts. Automaton has 10 states and 23 transitions. Word has length 6 [2018-06-24 21:03:06,821 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,821 INFO ]: Abstraction has 10 states and 23 transitions. [2018-06-24 21:03:06,821 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,821 INFO ]: Start isEmpty. Operand 10 states and 23 transitions. [2018-06-24 21:03:06,822 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:03:06,822 INFO ]: Found error trace [2018-06-24 21:03:06,822 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:03:06,822 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,822 INFO ]: Analyzing trace with hash 1644334789, now seen corresponding path program 1 times [2018-06-24 21:03:06,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,830 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,863 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,863 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,863 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,863 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,864 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,864 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,864 INFO ]: Start difference. First operand 10 states and 23 transitions. Second operand 3 states. [2018-06-24 21:03:06,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:06,914 INFO ]: Finished difference Result 13 states and 30 transitions. [2018-06-24 21:03:06,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:06,915 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 21:03:06,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:06,915 INFO ]: With dead ends: 13 [2018-06-24 21:03:06,915 INFO ]: Without dead ends: 13 [2018-06-24 21:03:06,916 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,916 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 21:03:06,917 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 8. [2018-06-24 21:03:06,917 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:06,917 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-24 21:03:06,917 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 6 [2018-06-24 21:03:06,918 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:06,918 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-24 21:03:06,918 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:06,918 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-24 21:03:06,918 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:03:06,918 INFO ]: Found error trace [2018-06-24 21:03:06,918 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:03:06,918 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:06,918 INFO ]: Analyzing trace with hash -566738182, now seen corresponding path program 1 times [2018-06-24 21:03:06,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:06,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:06,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:06,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:06,926 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:06,988 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:06,988 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:06,988 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:03:06,988 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:03:06,988 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:03:06,988 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:06,988 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 3 states. [2018-06-24 21:03:07,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:07,104 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-24 21:03:07,105 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:03:07,105 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 21:03:07,105 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:07,105 INFO ]: With dead ends: 10 [2018-06-24 21:03:07,105 INFO ]: Without dead ends: 8 [2018-06-24 21:03:07,106 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:03:07,106 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:03:07,107 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:03:07,107 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:03:07,107 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 21:03:07,107 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-24 21:03:07,107 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:07,107 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 21:03:07,107 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:03:07,107 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 21:03:07,107 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:03:07,107 INFO ]: Found error trace [2018-06-24 21:03:07,107 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:03:07,107 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:03:07,107 INFO ]: Analyzing trace with hash -565814661, now seen corresponding path program 1 times [2018-06-24 21:03:07,107 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:03:07,107 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:03:07,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:07,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:03:07,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:03:07,129 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:03:07,174 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:03:07,174 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:03:07,174 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 21:03:07,175 INFO ]: Interpolant automaton has 4 states [2018-06-24 21:03:07,175 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 21:03:07,175 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:07,175 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-24 21:03:07,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:03:07,190 INFO ]: Finished difference Result 4 states and 4 transitions. [2018-06-24 21:03:07,190 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:03:07,190 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 21:03:07,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:03:07,191 INFO ]: With dead ends: 4 [2018-06-24 21:03:07,191 INFO ]: Without dead ends: 0 [2018-06-24 21:03:07,191 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 21:03:07,191 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 21:03:07,191 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 21:03:07,191 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 21:03:07,191 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 21:03:07,191 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-24 21:03:07,191 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:03:07,191 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 21:03:07,191 INFO ]: Interpolant automaton has 4 states. [2018-06-24 21:03:07,191 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 21:03:07,191 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 21:03:07,193 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:03:07,195 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:03:07 BasicIcfg [2018-06-24 21:03:07,195 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:03:07,196 INFO ]: Toolchain (without parser) took 3085.07 ms. Allocated memory was 306.7 MB in the beginning and 325.6 MB in the end (delta: 18.9 MB). Free memory was 258.1 MB in the beginning and 262.7 MB in the end (delta: -4.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:07,197 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:03:07,197 INFO ]: ChcToBoogie took 61.23 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 255.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:07,197 INFO ]: Boogie Preprocessor took 58.46 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:03:07,198 INFO ]: RCFGBuilder took 637.08 ms. Allocated memory is still 306.7 MB. Free memory was 254.1 MB in the beginning and 237.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:07,198 INFO ]: BlockEncodingV2 took 140.74 ms. Allocated memory is still 306.7 MB. Free memory was 237.1 MB in the beginning and 231.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:03:07,198 INFO ]: TraceAbstraction took 2175.73 ms. Allocated memory was 306.7 MB in the beginning and 325.6 MB in the end (delta: 18.9 MB). Free memory was 231.1 MB in the beginning and 262.7 MB in the end (delta: -31.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:03:07,202 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 43 edges - StatisticsResult: Encoded RCFG 8 locations, 32 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.23 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 255.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 58.46 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 637.08 ms. Allocated memory is still 306.7 MB. Free memory was 254.1 MB in the beginning and 237.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 140.74 ms. Allocated memory is still 306.7 MB. Free memory was 237.1 MB in the beginning and 231.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2175.73 ms. Allocated memory was 306.7 MB in the beginning and 325.6 MB in the end (delta: 18.9 MB). Free memory was 231.1 MB in the beginning and 262.7 MB in the end (delta: -31.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 54 SDslu, 111 SDs, 0 SdLazy, 98 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-03-07-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-03-07-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-03-07-214.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/011b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-03-07-214.csv Received shutdown request...