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/014c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:06:28,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:06:28,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:06:28,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:06:28,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:06:28,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:06:28,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:06:28,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:06:28,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:06:28,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:06:28,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:06:28,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:06:28,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:06:28,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:06:28,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:06:28,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:06:28,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:06:28,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:06:28,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:06:28,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:06:28,655 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:06:28,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:06:28,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:06:28,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:06:28,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:06:28,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:06:28,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:06:28,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:06:28,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:06:28,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:06:28,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:06:28,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:06:28,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:06:28,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:06:28,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:06:28,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:06:28,672 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:06:28,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:06:28,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:06:28,692 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:06:28,693 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:06:28,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:06:28,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:06:28,694 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:06:28,694 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:06:28,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:06:28,695 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:06:28,695 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:06:28,695 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:06:28,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:06:28,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:06:28,696 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:06:28,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:06:28,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:06:28,696 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:06:28,696 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:06:28,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:06:28,698 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:06:28,699 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:06:28,699 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:06:28,748 INFO ]: Repository-Root is: /tmp [2018-06-26 18:06:28,765 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:06:28,771 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:06:28,772 INFO ]: Initializing SmtParser... [2018-06-26 18:06:28,773 INFO ]: SmtParser initialized [2018-06-26 18:06:28,773 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-26 18:06:28,774 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 18:06:28,860 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 unknown [2018-06-26 18:06:29,054 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014c-horn.smt2 [2018-06-26 18:06:29,059 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:06:29,064 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:06:29,065 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:06:29,065 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:06:29,065 INFO ]: ChcToBoogie initialized [2018-06-26 18:06:29,068 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,124 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29 Unit [2018-06-26 18:06:29,124 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:06:29,124 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:06:29,124 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:06:29,125 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:06:29,148 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,148 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,155 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,155 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,159 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,168 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,169 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,171 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:06:29,173 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:06:29,173 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:06:29,173 INFO ]: RCFGBuilder initialized [2018-06-26 18:06:29,174 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 18:06:29,188 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:06:29,188 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:06:29,188 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:06:29,188 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:06:29,188 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:06:29,188 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:06:29,600 INFO ]: Using library mode [2018-06-26 18:06:29,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:29 BoogieIcfgContainer [2018-06-26 18:06:29,600 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:06:29,600 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:06:29,600 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:06:29,601 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:06:29,601 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:29" (1/1) ... [2018-06-26 18:06:29,614 INFO ]: Initial Icfg 12 locations, 24 edges [2018-06-26 18:06:29,615 INFO ]: Using Remove infeasible edges [2018-06-26 18:06:29,615 INFO ]: Using Maximize final states [2018-06-26 18:06:29,616 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:06:29,616 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:06:29,619 INFO ]: Using Remove sink states [2018-06-26 18:06:29,620 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:06:29,620 INFO ]: Using Use SBE [2018-06-26 18:06:29,626 INFO ]: SBE split 0 edges [2018-06-26 18:06:29,631 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 18:06:29,632 INFO ]: 0 new accepting states [2018-06-26 18:06:29,689 INFO ]: Removed 8 edges and 2 locations by large block encoding [2018-06-26 18:06:29,692 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:06:29,693 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:06:29,693 INFO ]: 0 new accepting states [2018-06-26 18:06:29,694 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:06:29,694 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:06:29,694 INFO ]: Encoded RCFG 8 locations, 17 edges [2018-06-26 18:06:29,694 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:06:29 BasicIcfg [2018-06-26 18:06:29,694 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:06:29,695 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:06:29,695 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:06:29,698 INFO ]: TraceAbstraction initialized [2018-06-26 18:06:29,699 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:06:29" (1/4) ... [2018-06-26 18:06:29,700 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2877fad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:06:29, skipping insertion in model container [2018-06-26 18:06:29,701 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:06:29" (2/4) ... [2018-06-26 18:06:29,701 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2877fad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:06:29, skipping insertion in model container [2018-06-26 18:06:29,701 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:06:29" (3/4) ... [2018-06-26 18:06:29,702 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2877fad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:06:29, skipping insertion in model container [2018-06-26 18:06:29,702 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:06:29" (4/4) ... [2018-06-26 18:06:29,704 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:06:29,714 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:06:29,730 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:06:29,774 INFO ]: Using default assertion order modulation [2018-06-26 18:06:29,775 INFO ]: Interprodecural is true [2018-06-26 18:06:29,775 INFO ]: Hoare is false [2018-06-26 18:06:29,775 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:06:29,775 INFO ]: Backedges is TWOTRACK [2018-06-26 18:06:29,775 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:06:29,775 INFO ]: Difference is false [2018-06-26 18:06:29,775 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:06:29,775 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:06:29,785 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 18:06:29,794 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:06:29,794 INFO ]: Found error trace [2018-06-26 18:06:29,795 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:06:29,795 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:29,800 INFO ]: Analyzing trace with hash 44148105, now seen corresponding path program 1 times [2018-06-26 18:06:29,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:29,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:29,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:29,831 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:29,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:29,881 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:29,940 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:29,942 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:29,942 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:29,943 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:29,954 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:29,955 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:29,958 INFO ]: Start difference. First operand 8 states. Second operand 3 states. [2018-06-26 18:06:29,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:29,995 INFO ]: Finished difference Result 9 states and 18 transitions. [2018-06-26 18:06:29,996 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:29,997 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:06:29,997 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:30,005 INFO ]: With dead ends: 9 [2018-06-26 18:06:30,005 INFO ]: Without dead ends: 9 [2018-06-26 18:06:30,007 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,019 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:06:30,035 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:06:30,037 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:06:30,037 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-06-26 18:06:30,038 INFO ]: Start accepts. Automaton has 9 states and 18 transitions. Word has length 5 [2018-06-26 18:06:30,039 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:30,039 INFO ]: Abstraction has 9 states and 18 transitions. [2018-06-26 18:06:30,039 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:30,039 INFO ]: Start isEmpty. Operand 9 states and 18 transitions. [2018-06-26 18:06:30,039 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:06:30,039 INFO ]: Found error trace [2018-06-26 18:06:30,039 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:06:30,039 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:30,039 INFO ]: Analyzing trace with hash 44176935, now seen corresponding path program 1 times [2018-06-26 18:06:30,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:30,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:30,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,134 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,134 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:30,134 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:30,135 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:30,135 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:30,135 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,139 INFO ]: Start difference. First operand 9 states and 18 transitions. Second operand 3 states. [2018-06-26 18:06:30,336 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:30,336 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-26 18:06:30,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:30,337 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:06:30,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:30,339 INFO ]: With dead ends: 12 [2018-06-26 18:06:30,339 INFO ]: Without dead ends: 12 [2018-06-26 18:06:30,340 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,340 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:06:30,344 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:06:30,344 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:30,344 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-06-26 18:06:30,344 INFO ]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 5 [2018-06-26 18:06:30,344 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:30,344 INFO ]: Abstraction has 10 states and 21 transitions. [2018-06-26 18:06:30,344 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:30,344 INFO ]: Start isEmpty. Operand 10 states and 21 transitions. [2018-06-26 18:06:30,344 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:30,345 INFO ]: Found error trace [2018-06-26 18:06:30,345 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:30,345 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:30,345 INFO ]: Analyzing trace with hash 1367970772, now seen corresponding path program 1 times [2018-06-26 18:06:30,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:30,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:30,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,365 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,429 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,429 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:30,429 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:30,430 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:30,430 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:30,430 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,430 INFO ]: Start difference. First operand 10 states and 21 transitions. Second operand 3 states. [2018-06-26 18:06:30,456 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:30,456 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-26 18:06:30,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:30,457 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:06:30,457 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:30,457 INFO ]: With dead ends: 11 [2018-06-26 18:06:30,457 INFO ]: Without dead ends: 10 [2018-06-26 18:06:30,458 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,458 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:06:30,459 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-26 18:06:30,459 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:06:30,460 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2018-06-26 18:06:30,460 INFO ]: Start accepts. Automaton has 9 states and 19 transitions. Word has length 6 [2018-06-26 18:06:30,460 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:30,460 INFO ]: Abstraction has 9 states and 19 transitions. [2018-06-26 18:06:30,460 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:30,460 INFO ]: Start isEmpty. Operand 9 states and 19 transitions. [2018-06-26 18:06:30,460 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:30,460 INFO ]: Found error trace [2018-06-26 18:06:30,460 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:30,460 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:30,461 INFO ]: Analyzing trace with hash 1368714586, now seen corresponding path program 1 times [2018-06-26 18:06:30,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:30,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:30,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,462 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,471 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,522 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,522 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:30,522 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:06:30,522 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:06:30,522 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:06:30,522 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,522 INFO ]: Start difference. First operand 9 states and 19 transitions. Second operand 3 states. [2018-06-26 18:06:30,638 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:30,638 INFO ]: Finished difference Result 13 states and 29 transitions. [2018-06-26 18:06:30,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:30,639 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:06:30,639 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:30,640 INFO ]: With dead ends: 13 [2018-06-26 18:06:30,640 INFO ]: Without dead ends: 13 [2018-06-26 18:06:30,640 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:06:30,640 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 18:06:30,642 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-26 18:06:30,642 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:30,642 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-06-26 18:06:30,642 INFO ]: Start accepts. Automaton has 11 states and 25 transitions. Word has length 6 [2018-06-26 18:06:30,644 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:30,644 INFO ]: Abstraction has 11 states and 25 transitions. [2018-06-26 18:06:30,644 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:06:30,644 INFO ]: Start isEmpty. Operand 11 states and 25 transitions. [2018-06-26 18:06:30,645 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:30,645 INFO ]: Found error trace [2018-06-26 18:06:30,645 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:30,645 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:30,645 INFO ]: Analyzing trace with hash 1368803959, now seen corresponding path program 1 times [2018-06-26 18:06:30,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:30,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:30,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,670 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,727 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:30,727 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:30,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,781 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,788 INFO ]: Computing forward predicates... [2018-06-26 18:06:30,819 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:30,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:06:30,852 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:30,852 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:30,852 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:30,852 INFO ]: Start difference. First operand 11 states and 25 transitions. Second operand 4 states. [2018-06-26 18:06:30,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:30,911 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-26 18:06:30,911 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:06:30,911 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:06:30,911 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:30,912 INFO ]: With dead ends: 10 [2018-06-26 18:06:30,912 INFO ]: Without dead ends: 10 [2018-06-26 18:06:30,912 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 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-26 18:06:30,912 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:06:30,913 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-26 18:06:30,913 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 18:06:30,914 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-26 18:06:30,914 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-26 18:06:30,914 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:30,914 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-26 18:06:30,914 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:30,914 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-26 18:06:30,914 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:06:30,914 INFO ]: Found error trace [2018-06-26 18:06:30,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:06:30,914 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:30,914 INFO ]: Analyzing trace with hash 1368864502, now seen corresponding path program 1 times [2018-06-26 18:06:30,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:30,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:30,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:30,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:30,930 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:30,978 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:30,978 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:30,979 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:06:30,979 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:30,979 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:30,979 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:30,979 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-26 18:06:31,085 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:31,086 INFO ]: Finished difference Result 12 states and 19 transitions. [2018-06-26 18:06:31,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:06:31,086 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 18:06:31,086 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:31,086 INFO ]: With dead ends: 12 [2018-06-26 18:06:31,086 INFO ]: Without dead ends: 12 [2018-06-26 18:06:31,087 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-26 18:06:31,087 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 18:06:31,088 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-06-26 18:06:31,088 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:31,088 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-26 18:06:31,088 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 6 [2018-06-26 18:06:31,088 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:31,089 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-26 18:06:31,089 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:31,089 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-26 18:06:31,089 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:06:31,089 INFO ]: Found error trace [2018-06-26 18:06:31,089 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:31,089 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:31,089 INFO ]: Analyzing trace with hash -517370714, now seen corresponding path program 1 times [2018-06-26 18:06:31,089 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:31,089 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:31,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:31,090 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:31,090 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:31,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:31,247 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:31,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:31,247 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:31,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:31,306 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:31,309 INFO ]: Computing forward predicates... [2018-06-26 18:06:31,575 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:31,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:31,595 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-26 18:06:31,595 INFO ]: Interpolant automaton has 8 states [2018-06-26 18:06:31,595 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 18:06:31,595 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:06:31,595 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 8 states. [2018-06-26 18:06:31,795 WARN ]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-26 18:06:31,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:31,833 INFO ]: Finished difference Result 14 states and 23 transitions. [2018-06-26 18:06:31,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:06:31,833 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-26 18:06:31,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:31,834 INFO ]: With dead ends: 14 [2018-06-26 18:06:31,834 INFO ]: Without dead ends: 14 [2018-06-26 18:06:31,834 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:06:31,834 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 18:06:31,836 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-06-26 18:06:31,836 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:31,836 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-26 18:06:31,836 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 7 [2018-06-26 18:06:31,836 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:31,836 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-26 18:06:31,836 INFO ]: Interpolant automaton has 8 states. [2018-06-26 18:06:31,836 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-26 18:06:31,836 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:06:31,836 INFO ]: Found error trace [2018-06-26 18:06:31,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:31,836 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:31,837 INFO ]: Analyzing trace with hash -515493881, now seen corresponding path program 1 times [2018-06-26 18:06:31,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:31,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:31,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:31,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:31,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:31,844 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:31,952 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:31,953 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:06:31,953 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 18:06:31,953 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:31,953 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:31,953 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:31,953 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 4 states. [2018-06-26 18:06:32,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:32,154 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-26 18:06:32,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:06:32,155 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 18:06:32,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:32,155 INFO ]: With dead ends: 10 [2018-06-26 18:06:32,155 INFO ]: Without dead ends: 9 [2018-06-26 18:06:32,155 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:32,155 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 18:06:32,156 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 18:06:32,156 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 18:06:32,156 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-26 18:06:32,156 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-26 18:06:32,157 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:32,157 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-26 18:06:32,157 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:32,157 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-26 18:06:32,157 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 18:06:32,157 INFO ]: Found error trace [2018-06-26 18:06:32,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:32,157 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:32,157 INFO ]: Analyzing trace with hash -488741563, now seen corresponding path program 1 times [2018-06-26 18:06:32,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:32,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:32,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:32,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,174 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,296 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,296 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:32,296 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:32,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:32,328 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,329 INFO ]: Computing forward predicates... [2018-06-26 18:06:32,335 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,369 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:32,369 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 18:06:32,370 INFO ]: Interpolant automaton has 4 states [2018-06-26 18:06:32,370 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 18:06:32,370 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:32,370 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 4 states. [2018-06-26 18:06:32,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:32,503 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-26 18:06:32,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:06:32,504 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 18:06:32,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:32,505 INFO ]: With dead ends: 10 [2018-06-26 18:06:32,505 INFO ]: Without dead ends: 10 [2018-06-26 18:06:32,505 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 18:06:32,505 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 18:06:32,506 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 18:06:32,506 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 18:06:32,506 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-26 18:06:32,506 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-26 18:06:32,506 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:32,507 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-26 18:06:32,507 INFO ]: Interpolant automaton has 4 states. [2018-06-26 18:06:32,507 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-26 18:06:32,507 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 18:06:32,507 INFO ]: Found error trace [2018-06-26 18:06:32,507 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:32,507 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:32,507 INFO ]: Analyzing trace with hash 2026383415, now seen corresponding path program 2 times [2018-06-26 18:06:32,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:32,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:32,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:32,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,528 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,594 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,594 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:32,594 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:32,603 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:06:32,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:06:32,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,647 INFO ]: Computing forward predicates... [2018-06-26 18:06:32,652 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,678 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:32,678 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:06:32,678 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:06:32,678 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:06:32,678 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:32,678 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-26 18:06:32,693 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:32,693 INFO ]: Finished difference Result 11 states and 17 transitions. [2018-06-26 18:06:32,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 18:06:32,693 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 18:06:32,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:32,694 INFO ]: With dead ends: 11 [2018-06-26 18:06:32,694 INFO ]: Without dead ends: 11 [2018-06-26 18:06:32,694 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:06:32,694 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 18:06:32,695 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 18:06:32,695 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 18:06:32,696 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-26 18:06:32,696 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-26 18:06:32,696 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:32,696 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-26 18:06:32,696 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:06:32,696 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-26 18:06:32,697 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 18:06:32,697 INFO ]: Found error trace [2018-06-26 18:06:32,697 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:32,697 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:32,697 INFO ]: Analyzing trace with hash -1609120891, now seen corresponding path program 3 times [2018-06-26 18:06:32,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:32,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:32,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:32,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:32,713 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,782 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:32,782 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:32,788 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:06:32,803 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 18:06:32,803 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:32,804 INFO ]: Computing forward predicates... [2018-06-26 18:06:32,840 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:32,860 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:32,860 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-26 18:06:32,860 INFO ]: Interpolant automaton has 11 states [2018-06-26 18:06:32,861 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 18:06:32,861 INFO ]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-06-26 18:06:32,861 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 11 states. [2018-06-26 18:06:33,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:33,082 INFO ]: Finished difference Result 22 states and 39 transitions. [2018-06-26 18:06:33,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:06:33,082 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-26 18:06:33,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:33,082 INFO ]: With dead ends: 22 [2018-06-26 18:06:33,082 INFO ]: Without dead ends: 22 [2018-06-26 18:06:33,083 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:06:33,083 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 18:06:33,086 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-06-26 18:06:33,086 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 18:06:33,086 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2018-06-26 18:06:33,086 INFO ]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 9 [2018-06-26 18:06:33,087 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:33,087 INFO ]: Abstraction has 12 states and 19 transitions. [2018-06-26 18:06:33,087 INFO ]: Interpolant automaton has 11 states. [2018-06-26 18:06:33,087 INFO ]: Start isEmpty. Operand 12 states and 19 transitions. [2018-06-26 18:06:33,087 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 18:06:33,087 INFO ]: Found error trace [2018-06-26 18:06:33,087 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:33,087 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:33,087 INFO ]: Analyzing trace with hash 1654362615, now seen corresponding path program 4 times [2018-06-26 18:06:33,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:33,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:33,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:33,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:33,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:33,098 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:33,162 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:33,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:33,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:33,171 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:06:33,193 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:06:33,193 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:33,196 INFO ]: Computing forward predicates... [2018-06-26 18:06:33,294 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:33,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:33,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 18:06:33,317 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:06:33,317 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:06:33,317 INFO ]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:06:33,317 INFO ]: Start difference. First operand 12 states and 19 transitions. Second operand 13 states. [2018-06-26 18:06:33,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:33,757 INFO ]: Finished difference Result 28 states and 51 transitions. [2018-06-26 18:06:33,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:06:33,758 INFO ]: Start accepts. Automaton has 13 states. Word has length 10 [2018-06-26 18:06:33,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:33,758 INFO ]: With dead ends: 28 [2018-06-26 18:06:33,758 INFO ]: Without dead ends: 28 [2018-06-26 18:06:33,759 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=503, Unknown=0, NotChecked=0, Total=756 [2018-06-26 18:06:33,759 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 18:06:33,761 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 13. [2018-06-26 18:06:33,761 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 18:06:33,761 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2018-06-26 18:06:33,761 INFO ]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 10 [2018-06-26 18:06:33,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:33,761 INFO ]: Abstraction has 13 states and 21 transitions. [2018-06-26 18:06:33,761 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:06:33,761 INFO ]: Start isEmpty. Operand 13 states and 21 transitions. [2018-06-26 18:06:33,761 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 18:06:33,761 INFO ]: Found error trace [2018-06-26 18:06:33,761 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:33,762 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:33,762 INFO ]: Analyzing trace with hash -256863803, now seen corresponding path program 5 times [2018-06-26 18:06:33,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:33,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:33,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:33,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:33,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:33,774 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:33,988 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:33,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:33,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:33,996 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 18:06:34,014 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 18:06:34,014 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:34,015 INFO ]: Computing forward predicates... [2018-06-26 18:06:34,087 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:34,105 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:34,105 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-26 18:06:34,106 INFO ]: Interpolant automaton has 15 states [2018-06-26 18:06:34,106 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 18:06:34,106 INFO ]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:06:34,106 INFO ]: Start difference. First operand 13 states and 21 transitions. Second operand 15 states. [2018-06-26 18:06:34,502 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:34,502 INFO ]: Finished difference Result 35 states and 65 transitions. [2018-06-26 18:06:34,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 18:06:34,503 INFO ]: Start accepts. Automaton has 15 states. Word has length 11 [2018-06-26 18:06:34,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:34,504 INFO ]: With dead ends: 35 [2018-06-26 18:06:34,504 INFO ]: Without dead ends: 35 [2018-06-26 18:06:34,504 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 18:06:34,505 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 18:06:34,506 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 14. [2018-06-26 18:06:34,506 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 18:06:34,507 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2018-06-26 18:06:34,507 INFO ]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 11 [2018-06-26 18:06:34,507 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:34,507 INFO ]: Abstraction has 14 states and 23 transitions. [2018-06-26 18:06:34,507 INFO ]: Interpolant automaton has 15 states. [2018-06-26 18:06:34,507 INFO ]: Start isEmpty. Operand 14 states and 23 transitions. [2018-06-26 18:06:34,507 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:06:34,507 INFO ]: Found error trace [2018-06-26 18:06:34,507 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:34,507 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:34,507 INFO ]: Analyzing trace with hash 624659383, now seen corresponding path program 6 times [2018-06-26 18:06:34,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:34,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:34,508 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:34,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:34,529 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:34,751 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:34,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:34,751 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:34,756 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 18:06:34,777 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 18:06:34,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:34,779 INFO ]: Computing forward predicates... [2018-06-26 18:06:34,854 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:34,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:34,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-26 18:06:34,874 INFO ]: Interpolant automaton has 17 states [2018-06-26 18:06:34,874 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 18:06:34,874 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-26 18:06:34,874 INFO ]: Start difference. First operand 14 states and 23 transitions. Second operand 17 states. [2018-06-26 18:06:35,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:35,308 INFO ]: Finished difference Result 43 states and 81 transitions. [2018-06-26 18:06:35,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 18:06:35,308 INFO ]: Start accepts. Automaton has 17 states. Word has length 12 [2018-06-26 18:06:35,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:35,309 INFO ]: With dead ends: 43 [2018-06-26 18:06:35,309 INFO ]: Without dead ends: 43 [2018-06-26 18:06:35,310 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=661, Invalid=1319, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 18:06:35,310 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 18:06:35,312 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 15. [2018-06-26 18:06:35,312 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 18:06:35,312 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2018-06-26 18:06:35,313 INFO ]: Start accepts. Automaton has 15 states and 25 transitions. Word has length 12 [2018-06-26 18:06:35,313 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:35,313 INFO ]: Abstraction has 15 states and 25 transitions. [2018-06-26 18:06:35,313 INFO ]: Interpolant automaton has 17 states. [2018-06-26 18:06:35,313 INFO ]: Start isEmpty. Operand 15 states and 25 transitions. [2018-06-26 18:06:35,313 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:06:35,313 INFO ]: Found error trace [2018-06-26 18:06:35,313 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:35,313 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:35,313 INFO ]: Analyzing trace with hash -2112892923, now seen corresponding path program 7 times [2018-06-26 18:06:35,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:35,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:35,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:35,314 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:06:35,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:35,326 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:35,427 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:35,427 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:06:35,427 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:06:35,433 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:35,466 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:06:35,468 INFO ]: Computing forward predicates... [2018-06-26 18:06:35,581 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:06:35,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:06:35,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 18:06:35,600 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:06:35,600 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:06:35,600 INFO ]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:06:35,600 INFO ]: Start difference. First operand 15 states and 25 transitions. Second operand 19 states. [2018-06-26 18:06:36,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:06:36,207 INFO ]: Finished difference Result 52 states and 99 transitions. [2018-06-26 18:06:36,207 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 18:06:36,208 INFO ]: Start accepts. Automaton has 19 states. Word has length 13 [2018-06-26 18:06:36,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:06:36,208 INFO ]: With dead ends: 52 [2018-06-26 18:06:36,208 INFO ]: Without dead ends: 52 [2018-06-26 18:06:36,209 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=991, Invalid=1979, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 18:06:36,210 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 18:06:36,211 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 16. [2018-06-26 18:06:36,211 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 18:06:36,212 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-06-26 18:06:36,212 INFO ]: Start accepts. Automaton has 16 states and 27 transitions. Word has length 13 [2018-06-26 18:06:36,212 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:06:36,212 INFO ]: Abstraction has 16 states and 27 transitions. [2018-06-26 18:06:36,212 INFO ]: Interpolant automaton has 19 states. [2018-06-26 18:06:36,212 INFO ]: Start isEmpty. Operand 16 states and 27 transitions. [2018-06-26 18:06:36,212 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 18:06:36,212 INFO ]: Found error trace [2018-06-26 18:06:36,213 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1] [2018-06-26 18:06:36,213 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:06:36,213 INFO ]: Analyzing trace with hash -1077668489, now seen corresponding path program 8 times [2018-06-26 18:06:36,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:06:36,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:06:36,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:36,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:06:36,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:06:36,231 INFO ]: Conjunction of SSA is sat [2018-06-26 18:06:36,238 INFO ]: Counterexample might be feasible [2018-06-26 18:06:36,256 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:06:36,257 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:06:36 BasicIcfg [2018-06-26 18:06:36,257 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:06:36,258 INFO ]: Toolchain (without parser) took 7199.01 ms. Allocated memory was 309.3 MB in the beginning and 382.2 MB in the end (delta: 72.9 MB). Free memory was 264.6 MB in the beginning and 275.4 MB in the end (delta: -10.8 MB). Peak memory consumption was 62.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,259 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-26 18:06:36,259 INFO ]: ChcToBoogie took 59.41 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,260 INFO ]: Boogie Preprocessor took 47.93 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,260 INFO ]: RCFGBuilder took 427.17 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,261 INFO ]: BlockEncodingV2 took 94.11 ms. Allocated memory is still 309.3 MB. Free memory was 249.6 MB in the beginning and 246.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,261 INFO ]: TraceAbstraction took 6561.84 ms. Allocated memory was 309.3 MB in the beginning and 382.2 MB in the end (delta: 72.9 MB). Free memory was 245.7 MB in the beginning and 275.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 43.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:06:36,265 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 24 edges - StatisticsResult: Encoded RCFG 8 locations, 17 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 59.41 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 47.93 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 3.6 GB. * RCFGBuilder took 427.17 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 94.11 ms. Allocated memory is still 309.3 MB. Free memory was 249.6 MB in the beginning and 246.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6561.84 ms. Allocated memory was 309.3 MB in the beginning and 382.2 MB in the end (delta: 72.9 MB). Free memory was 245.7 MB in the beginning and 275.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 43.1 MB. 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, 0, 0, 0); [L0] assume (((((hbv_False_1_Int + -1 == hbv_False_3_Int && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_2_Int + -10 == 0) && !(hbv_False_2_Int <= 1)) && !(hbv_False_1_Int + hbv_False_4_Int + -10 == 0)) && !(hbv_False_1_Int <= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int; [L0] havoc hbv_False_1_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_6_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((((hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int && !(hhv_REC_f_f_2_Int <= 1)) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_2_Int + hbv_REC_f_f_4_Int == hhv_REC_f_f_3_Int) && hhv_REC_f_f_2_Int + -1 == hbv_REC_f_f_3_Int) && !(hhv_REC_f_f_2_Int + -10 == 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int; [L0] hhv_REC_f_f_0_Int, hhv_REC_f_f_1_Int, hhv_REC_f_f_2_Int, hhv_REC_f_f_3_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int; [L0] havoc hbv_REC_f_f_3_Int, hbv_REC_f_f_4_Int, hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] assume (((hhv_REC_f_f_3_Int == hhv_REC_f_f_2_Int && hhv_REC_f_f_0_Int + hbv_REC_f_f_1_Int == hhv_REC_f_f_1_Int) && !(hhv_REC_f_f_0_Int <= 0)) && hhv_REC_f_f_0_Int + -1 == hbv_REC_f_f_2_Int) && hhv_REC_f_f_2_Int <= 1; [L0] hhv_REC_f__0_Int, hhv_REC_f__1_Int := hbv_REC_f_f_2_Int, hbv_REC_f_f_1_Int; [L0] havoc hbv_REC_f_f_1_Int, hbv_REC_f_f_2_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 16 OverallIterations, 8 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 155 SDtfs, 29 SDslu, 331 SDs, 0 SdLazy, 427 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=15, 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, 15 MinimizatonAttempts, 123 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1027 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 3/175 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/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-06-36-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-06-36-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-06-36-277.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014c-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-06-36-277.csv Received shutdown request...