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/llreve-bench/smt2/faulty__limit2!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:41:42,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:41:42,692 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:41:42,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:41:42,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:41:42,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:41:42,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:41:42,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:41:42,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:41:42,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:41:42,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:41:42,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:41:42,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:41:42,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:41:42,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:41:42,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:41:42,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:41:42,722 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:41:42,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:41:42,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:41:42,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:41:42,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:41:42,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:41:42,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:41:42,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:41:42,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:41:42,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:41:42,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:41:42,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:41:42,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:41:42,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:41:42,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:41:42,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:41:42,748 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:41:42,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:41:42,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:41:42,750 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:41:42,768 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:41:42,768 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:41:42,769 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:41:42,769 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:41:42,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:41:42,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:41:42,770 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:41:42,770 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:41:42,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:41:42,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:41:42,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:41:42,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:41:42,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:41:42,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:41:42,771 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:41:42,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:41:42,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:41:42,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:41:42,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:41:42,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:41:42,773 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:41:42,774 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:41:42,774 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:41:42,817 INFO ]: Repository-Root is: /tmp [2018-06-26 18:41:42,830 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:41:42,834 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:41:42,835 INFO ]: Initializing SmtParser... [2018-06-26 18:41:42,835 INFO ]: SmtParser initialized [2018-06-26 18:41:42,836 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-26 18:41:42,837 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:41:42,924 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@5c422803 [2018-06-26 18:41:43,153 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-26 18:41:43,157 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:41:43,165 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:41:43,165 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:41:43,165 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:41:43,165 INFO ]: ChcToBoogie initialized [2018-06-26 18:41:43,168 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,231 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43 Unit [2018-06-26 18:41:43,232 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:41:43,235 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:41:43,235 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:41:43,235 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:41:43,257 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,258 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,265 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,265 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,270 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,274 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,275 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,277 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:41:43,278 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:41:43,278 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:41:43,278 INFO ]: RCFGBuilder initialized [2018-06-26 18:41:43,279 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (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:41:43,295 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:41:43,295 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:41:43,295 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:41:43,295 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:41:43,295 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:41:43,295 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:41:43,697 INFO ]: Using library mode [2018-06-26 18:41:43,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:43 BoogieIcfgContainer [2018-06-26 18:41:43,698 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:41:43,698 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:41:43,698 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:41:43,699 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:41:43,700 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:43" (1/1) ... [2018-06-26 18:41:43,716 INFO ]: Initial Icfg 28 locations, 48 edges [2018-06-26 18:41:43,718 INFO ]: Using Remove infeasible edges [2018-06-26 18:41:43,718 INFO ]: Using Maximize final states [2018-06-26 18:41:43,719 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:41:43,719 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:41:43,721 INFO ]: Using Remove sink states [2018-06-26 18:41:43,721 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:41:43,721 INFO ]: Using Use SBE [2018-06-26 18:41:43,729 INFO ]: SBE split 0 edges [2018-06-26 18:41:43,733 INFO ]: Removed 5 edges and 2 locations because of local infeasibility [2018-06-26 18:41:43,735 INFO ]: 0 new accepting states [2018-06-26 18:41:43,809 INFO ]: Removed 18 edges and 6 locations by large block encoding [2018-06-26 18:41:43,811 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:43,813 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:41:43,813 INFO ]: 0 new accepting states [2018-06-26 18:41:43,814 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:41:43,814 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:41:43,815 INFO ]: Encoded RCFG 20 locations, 37 edges [2018-06-26 18:41:43,815 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:43 BasicIcfg [2018-06-26 18:41:43,815 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:41:43,816 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:41:43,816 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:41:43,818 INFO ]: TraceAbstraction initialized [2018-06-26 18:41:43,819 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:41:43" (1/4) ... [2018-06-26 18:41:43,819 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db3cc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:41:43, skipping insertion in model container [2018-06-26 18:41:43,820 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:41:43" (2/4) ... [2018-06-26 18:41:43,820 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db3cc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:41:43, skipping insertion in model container [2018-06-26 18:41:43,820 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:41:43" (3/4) ... [2018-06-26 18:41:43,820 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db3cc13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:41:43, skipping insertion in model container [2018-06-26 18:41:43,820 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:41:43" (4/4) ... [2018-06-26 18:41:43,822 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:41:43,831 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:41:43,842 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:41:43,885 INFO ]: Using default assertion order modulation [2018-06-26 18:41:43,886 INFO ]: Interprodecural is true [2018-06-26 18:41:43,886 INFO ]: Hoare is false [2018-06-26 18:41:43,886 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:41:43,886 INFO ]: Backedges is TWOTRACK [2018-06-26 18:41:43,886 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:41:43,886 INFO ]: Difference is false [2018-06-26 18:41:43,886 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:41:43,886 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:41:43,896 INFO ]: Start isEmpty. Operand 20 states. [2018-06-26 18:41:43,908 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:41:43,908 INFO ]: Found error trace [2018-06-26 18:41:43,909 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:41:43,909 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:43,914 INFO ]: Analyzing trace with hash 41193768, now seen corresponding path program 1 times [2018-06-26 18:41:43,916 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:43,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:43,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:43,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:43,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:43,996 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:44,041 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:41:44,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:44,043 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:44,044 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:44,056 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:44,057 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:44,059 INFO ]: Start difference. First operand 20 states. Second operand 3 states. [2018-06-26 18:41:44,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:44,347 INFO ]: Finished difference Result 34 states and 63 transitions. [2018-06-26 18:41:44,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:44,350 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:41:44,350 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:44,366 INFO ]: With dead ends: 34 [2018-06-26 18:41:44,366 INFO ]: Without dead ends: 34 [2018-06-26 18:41:44,368 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:41:44,386 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 18:41:44,423 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 18:41:44,424 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 18:41:44,427 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-06-26 18:41:44,430 INFO ]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 5 [2018-06-26 18:41:44,431 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:44,431 INFO ]: Abstraction has 34 states and 63 transitions. [2018-06-26 18:41:44,431 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:44,431 INFO ]: Start isEmpty. Operand 34 states and 63 transitions. [2018-06-26 18:41:44,433 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:41:44,433 INFO ]: Found error trace [2018-06-26 18:41:44,433 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:41:44,433 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:44,433 INFO ]: Analyzing trace with hash 41252389, now seen corresponding path program 1 times [2018-06-26 18:41:44,433 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:44,433 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:44,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:44,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:44,500 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:41:44,500 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:44,500 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:44,501 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:44,501 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:44,501 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:44,501 INFO ]: Start difference. First operand 34 states and 63 transitions. Second operand 3 states. [2018-06-26 18:41:44,657 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:44,657 INFO ]: Finished difference Result 48 states and 90 transitions. [2018-06-26 18:41:44,658 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:44,658 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:41:44,658 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:44,660 INFO ]: With dead ends: 48 [2018-06-26 18:41:44,660 INFO ]: Without dead ends: 48 [2018-06-26 18:41:44,661 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:41:44,661 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 18:41:44,671 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 18:41:44,671 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 18:41:44,673 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 90 transitions. [2018-06-26 18:41:44,673 INFO ]: Start accepts. Automaton has 48 states and 90 transitions. Word has length 5 [2018-06-26 18:41:44,673 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:44,673 INFO ]: Abstraction has 48 states and 90 transitions. [2018-06-26 18:41:44,673 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:44,673 INFO ]: Start isEmpty. Operand 48 states and 90 transitions. [2018-06-26 18:41:44,675 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:44,675 INFO ]: Found error trace [2018-06-26 18:41:44,675 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:44,675 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:44,675 INFO ]: Analyzing trace with hash 1283834999, now seen corresponding path program 1 times [2018-06-26 18:41:44,675 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:44,675 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:44,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:44,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,688 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:44,714 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:41:44,714 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:44,714 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:44,714 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:44,714 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:44,714 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:44,715 INFO ]: Start difference. First operand 48 states and 90 transitions. Second operand 3 states. [2018-06-26 18:41:44,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:44,766 INFO ]: Finished difference Result 69 states and 143 transitions. [2018-06-26 18:41:44,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:44,766 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:44,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:44,771 INFO ]: With dead ends: 69 [2018-06-26 18:41:44,772 INFO ]: Without dead ends: 69 [2018-06-26 18:41:44,772 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:41:44,772 INFO ]: Start minimizeSevpa. Operand 69 states. [2018-06-26 18:41:44,784 INFO ]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-06-26 18:41:44,785 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:41:44,787 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 96 transitions. [2018-06-26 18:41:44,787 INFO ]: Start accepts. Automaton has 51 states and 96 transitions. Word has length 6 [2018-06-26 18:41:44,787 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:44,787 INFO ]: Abstraction has 51 states and 96 transitions. [2018-06-26 18:41:44,787 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:44,787 INFO ]: Start isEmpty. Operand 51 states and 96 transitions. [2018-06-26 18:41:44,789 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:44,789 INFO ]: Found error trace [2018-06-26 18:41:44,789 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:44,789 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:44,789 INFO ]: Analyzing trace with hash 1284342407, now seen corresponding path program 1 times [2018-06-26 18:41:44,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:44,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:44,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:44,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,799 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:44,831 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:41:44,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:44,831 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:44,831 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:44,831 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:44,831 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:44,831 INFO ]: Start difference. First operand 51 states and 96 transitions. Second operand 3 states. [2018-06-26 18:41:44,913 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:44,913 INFO ]: Finished difference Result 54 states and 99 transitions. [2018-06-26 18:41:44,915 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:44,915 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:44,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:44,917 INFO ]: With dead ends: 54 [2018-06-26 18:41:44,917 INFO ]: Without dead ends: 54 [2018-06-26 18:41:44,917 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:41:44,917 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-26 18:41:44,931 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-26 18:41:44,931 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-26 18:41:44,932 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 99 transitions. [2018-06-26 18:41:44,932 INFO ]: Start accepts. Automaton has 54 states and 99 transitions. Word has length 6 [2018-06-26 18:41:44,933 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:44,933 INFO ]: Abstraction has 54 states and 99 transitions. [2018-06-26 18:41:44,933 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:44,933 INFO ]: Start isEmpty. Operand 54 states and 99 transitions. [2018-06-26 18:41:44,936 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 18:41:44,936 INFO ]: Found error trace [2018-06-26 18:41:44,937 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 18:41:44,937 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:44,937 INFO ]: Analyzing trace with hash 1285354340, now seen corresponding path program 1 times [2018-06-26 18:41:44,937 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:44,937 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:44,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:44,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:44,945 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:44,977 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:41:44,977 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:44,977 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:44,977 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:44,978 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:44,978 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:44,978 INFO ]: Start difference. First operand 54 states and 99 transitions. Second operand 3 states. [2018-06-26 18:41:45,077 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:45,077 INFO ]: Finished difference Result 70 states and 131 transitions. [2018-06-26 18:41:45,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:45,078 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 18:41:45,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:45,079 INFO ]: With dead ends: 70 [2018-06-26 18:41:45,079 INFO ]: Without dead ends: 70 [2018-06-26 18:41:45,079 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:41:45,080 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 18:41:45,089 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-26 18:41:45,089 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 18:41:45,091 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 131 transitions. [2018-06-26 18:41:45,091 INFO ]: Start accepts. Automaton has 70 states and 131 transitions. Word has length 6 [2018-06-26 18:41:45,091 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:45,091 INFO ]: Abstraction has 70 states and 131 transitions. [2018-06-26 18:41:45,091 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:45,091 INFO ]: Start isEmpty. Operand 70 states and 131 transitions. [2018-06-26 18:41:45,093 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:45,093 INFO ]: Found error trace [2018-06-26 18:41:45,093 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:45,094 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:45,094 INFO ]: Analyzing trace with hash 451585882, now seen corresponding path program 1 times [2018-06-26 18:41:45,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:45,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:45,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:45,095 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:45,095 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:45,111 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:45,163 INFO ]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:41:45,163 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:45,163 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:45,163 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:45,163 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:45,164 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:45,164 INFO ]: Start difference. First operand 70 states and 131 transitions. Second operand 3 states. [2018-06-26 18:41:45,251 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:45,251 INFO ]: Finished difference Result 74 states and 135 transitions. [2018-06-26 18:41:45,251 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:45,251 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:41:45,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:45,253 INFO ]: With dead ends: 74 [2018-06-26 18:41:45,253 INFO ]: Without dead ends: 74 [2018-06-26 18:41:45,253 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:41:45,253 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-26 18:41:45,267 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-06-26 18:41:45,267 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 18:41:45,272 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2018-06-26 18:41:45,273 INFO ]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 12 [2018-06-26 18:41:45,273 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:45,273 INFO ]: Abstraction has 74 states and 135 transitions. [2018-06-26 18:41:45,273 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:45,273 INFO ]: Start isEmpty. Operand 74 states and 135 transitions. [2018-06-26 18:41:45,275 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:45,275 INFO ]: Found error trace [2018-06-26 18:41:45,275 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:45,276 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:45,276 INFO ]: Analyzing trace with hash -2109471604, now seen corresponding path program 1 times [2018-06-26 18:41:45,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:45,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:45,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:45,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:45,312 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:45,515 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:45,515 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:45,515 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:41:45,516 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:41:45,516 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:41:45,516 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:41:45,516 INFO ]: Start difference. First operand 74 states and 135 transitions. Second operand 6 states. [2018-06-26 18:41:45,905 WARN ]: Spent 363.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-06-26 18:41:46,027 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:46,027 INFO ]: Finished difference Result 118 states and 233 transitions. [2018-06-26 18:41:46,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 18:41:46,030 INFO ]: Start accepts. Automaton has 6 states. Word has length 12 [2018-06-26 18:41:46,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:46,033 INFO ]: With dead ends: 118 [2018-06-26 18:41:46,033 INFO ]: Without dead ends: 118 [2018-06-26 18:41:46,034 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 18:41:46,034 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-26 18:41:46,054 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 82. [2018-06-26 18:41:46,054 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-26 18:41:46,056 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 147 transitions. [2018-06-26 18:41:46,056 INFO ]: Start accepts. Automaton has 82 states and 147 transitions. Word has length 12 [2018-06-26 18:41:46,056 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:46,056 INFO ]: Abstraction has 82 states and 147 transitions. [2018-06-26 18:41:46,056 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:41:46,056 INFO ]: Start isEmpty. Operand 82 states and 147 transitions. [2018-06-26 18:41:46,058 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 18:41:46,059 INFO ]: Found error trace [2018-06-26 18:41:46,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:46,059 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:46,059 INFO ]: Analyzing trace with hash -1134717509, now seen corresponding path program 1 times [2018-06-26 18:41:46,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:46,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:46,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:46,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,067 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:46,084 INFO ]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 18:41:46,084 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:46,084 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:41:46,084 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:41:46,084 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:41:46,084 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:41:46,084 INFO ]: Start difference. First operand 82 states and 147 transitions. Second operand 3 states. [2018-06-26 18:41:46,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:46,094 INFO ]: Finished difference Result 95 states and 180 transitions. [2018-06-26 18:41:46,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:41:46,096 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 18:41:46,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:46,098 INFO ]: With dead ends: 95 [2018-06-26 18:41:46,098 INFO ]: Without dead ends: 91 [2018-06-26 18:41:46,098 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:41:46,098 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-26 18:41:46,120 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-06-26 18:41:46,120 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-26 18:41:46,122 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 143 transitions. [2018-06-26 18:41:46,122 INFO ]: Start accepts. Automaton has 82 states and 143 transitions. Word has length 12 [2018-06-26 18:41:46,122 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:46,122 INFO ]: Abstraction has 82 states and 143 transitions. [2018-06-26 18:41:46,122 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:41:46,122 INFO ]: Start isEmpty. Operand 82 states and 143 transitions. [2018-06-26 18:41:46,125 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 18:41:46,125 INFO ]: Found error trace [2018-06-26 18:41:46,125 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:46,125 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:46,125 INFO ]: Analyzing trace with hash 1113223821, now seen corresponding path program 1 times [2018-06-26 18:41:46,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:46,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:46,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:46,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,148 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:46,279 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:41:46,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:46,279 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:41:46,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:46,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:46,316 INFO ]: Computing forward predicates... [2018-06-26 18:41:46,342 INFO ]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 18:41:46,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:46,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 18:41:46,364 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:41:46,364 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:41:46,364 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:46,364 INFO ]: Start difference. First operand 82 states and 143 transitions. Second operand 5 states. [2018-06-26 18:41:46,402 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:46,402 INFO ]: Finished difference Result 78 states and 146 transitions. [2018-06-26 18:41:46,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 18:41:46,405 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-26 18:41:46,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:46,406 INFO ]: With dead ends: 78 [2018-06-26 18:41:46,406 INFO ]: Without dead ends: 56 [2018-06-26 18:41:46,406 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:41:46,407 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-26 18:41:46,416 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-06-26 18:41:46,416 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 18:41:46,417 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2018-06-26 18:41:46,417 INFO ]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 13 [2018-06-26 18:41:46,417 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:46,418 INFO ]: Abstraction has 51 states and 83 transitions. [2018-06-26 18:41:46,418 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:41:46,418 INFO ]: Start isEmpty. Operand 51 states and 83 transitions. [2018-06-26 18:41:46,425 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 18:41:46,425 INFO ]: Found error trace [2018-06-26 18:41:46,425 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:46,425 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:46,425 INFO ]: Analyzing trace with hash 505278767, now seen corresponding path program 1 times [2018-06-26 18:41:46,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:46,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:46,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:46,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:46,469 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:46,806 WARN ]: Spent 120.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-06-26 18:41:46,873 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:41:46,874 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:46,874 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:41:46,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:46,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:46,920 INFO ]: Computing forward predicates... [2018-06-26 18:41:47,355 INFO ]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 18:41:47,388 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:47,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-26 18:41:47,389 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:41:47,389 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:41:47,389 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:41:47,389 INFO ]: Start difference. First operand 51 states and 83 transitions. Second operand 13 states. [2018-06-26 18:41:47,831 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-06-26 18:41:47,985 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-06-26 18:41:48,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:48,639 INFO ]: Finished difference Result 105 states and 189 transitions. [2018-06-26 18:41:48,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:41:48,640 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-26 18:41:48,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:48,643 INFO ]: With dead ends: 105 [2018-06-26 18:41:48,643 INFO ]: Without dead ends: 87 [2018-06-26 18:41:48,643 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-06-26 18:41:48,643 INFO ]: Start minimizeSevpa. Operand 87 states. [2018-06-26 18:41:48,650 INFO ]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-06-26 18:41:48,650 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 18:41:48,652 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2018-06-26 18:41:48,652 INFO ]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 18 [2018-06-26 18:41:48,652 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:48,652 INFO ]: Abstraction has 69 states and 107 transitions. [2018-06-26 18:41:48,652 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:41:48,652 INFO ]: Start isEmpty. Operand 69 states and 107 transitions. [2018-06-26 18:41:48,654 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:41:48,654 INFO ]: Found error trace [2018-06-26 18:41:48,654 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:48,654 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:48,654 INFO ]: Analyzing trace with hash -432822347, now seen corresponding path program 2 times [2018-06-26 18:41:48,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:48,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:48,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:48,655 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:48,655 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:48,681 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:48,882 INFO ]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 18:41:48,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:48,882 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:41:48,889 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 18:41:48,919 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 18:41:48,919 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:48,923 INFO ]: Computing forward predicates... [2018-06-26 18:41:49,436 INFO ]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 18:41:49,455 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:49,455 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-26 18:41:49,455 INFO ]: Interpolant automaton has 20 states [2018-06-26 18:41:49,455 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 18:41:49,455 INFO ]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:41:49,455 INFO ]: Start difference. First operand 69 states and 107 transitions. Second operand 20 states. [2018-06-26 18:41:49,804 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-06-26 18:41:50,217 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 15 [2018-06-26 18:41:50,504 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-06-26 18:41:51,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:51,314 INFO ]: Finished difference Result 153 states and 325 transitions. [2018-06-26 18:41:51,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 18:41:51,314 INFO ]: Start accepts. Automaton has 20 states. Word has length 30 [2018-06-26 18:41:51,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:51,317 INFO ]: With dead ends: 153 [2018-06-26 18:41:51,317 INFO ]: Without dead ends: 153 [2018-06-26 18:41:51,318 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 18:41:51,318 INFO ]: Start minimizeSevpa. Operand 153 states. [2018-06-26 18:41:51,334 INFO ]: Finished minimizeSevpa. Reduced states from 153 to 87. [2018-06-26 18:41:51,334 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-26 18:41:51,336 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2018-06-26 18:41:51,336 INFO ]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 30 [2018-06-26 18:41:51,336 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:51,336 INFO ]: Abstraction has 87 states and 137 transitions. [2018-06-26 18:41:51,336 INFO ]: Interpolant automaton has 20 states. [2018-06-26 18:41:51,336 INFO ]: Start isEmpty. Operand 87 states and 137 transitions. [2018-06-26 18:41:51,338 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:41:51,338 INFO ]: Found error trace [2018-06-26 18:41:51,338 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:51,338 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:51,338 INFO ]: Analyzing trace with hash 205485702, now seen corresponding path program 1 times [2018-06-26 18:41:51,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:51,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:51,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:51,339 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:41:51,339 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:51,350 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:51,582 INFO ]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:41:51,582 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:51,582 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 18:41:51,582 INFO ]: Interpolant automaton has 5 states [2018-06-26 18:41:51,582 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 18:41:51,582 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 18:41:51,582 INFO ]: Start difference. First operand 87 states and 137 transitions. Second operand 5 states. [2018-06-26 18:41:51,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:51,743 INFO ]: Finished difference Result 96 states and 155 transitions. [2018-06-26 18:41:51,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 18:41:51,744 INFO ]: Start accepts. Automaton has 5 states. Word has length 30 [2018-06-26 18:41:51,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:51,745 INFO ]: With dead ends: 96 [2018-06-26 18:41:51,745 INFO ]: Without dead ends: 91 [2018-06-26 18:41:51,746 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:41:51,746 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-26 18:41:51,756 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-06-26 18:41:51,756 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-26 18:41:51,757 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2018-06-26 18:41:51,758 INFO ]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 30 [2018-06-26 18:41:51,758 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:51,758 INFO ]: Abstraction has 88 states and 137 transitions. [2018-06-26 18:41:51,758 INFO ]: Interpolant automaton has 5 states. [2018-06-26 18:41:51,758 INFO ]: Start isEmpty. Operand 88 states and 137 transitions. [2018-06-26 18:41:51,759 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 18:41:51,759 INFO ]: Found error trace [2018-06-26 18:41:51,759 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:51,759 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:51,759 INFO ]: Analyzing trace with hash 1315246214, now seen corresponding path program 1 times [2018-06-26 18:41:51,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:51,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:51,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:51,762 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:51,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:51,780 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:51,865 INFO ]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 18:41:51,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:41:51,865 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-26 18:41:51,865 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:41:51,865 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:41:51,865 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:41:51,865 INFO ]: Start difference. First operand 88 states and 137 transitions. Second operand 6 states. [2018-06-26 18:41:52,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:41:52,001 INFO ]: Finished difference Result 92 states and 143 transitions. [2018-06-26 18:41:52,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:41:52,002 INFO ]: Start accepts. Automaton has 6 states. Word has length 31 [2018-06-26 18:41:52,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:41:52,003 INFO ]: With dead ends: 92 [2018-06-26 18:41:52,003 INFO ]: Without dead ends: 89 [2018-06-26 18:41:52,003 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:41:52,003 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-26 18:41:52,008 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-06-26 18:41:52,008 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-26 18:41:52,019 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2018-06-26 18:41:52,020 INFO ]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 31 [2018-06-26 18:41:52,020 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:41:52,020 INFO ]: Abstraction has 87 states and 133 transitions. [2018-06-26 18:41:52,020 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:41:52,020 INFO ]: Start isEmpty. Operand 87 states and 133 transitions. [2018-06-26 18:41:52,022 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 18:41:52,022 INFO ]: Found error trace [2018-06-26 18:41:52,022 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:41:52,022 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:41:52,022 INFO ]: Analyzing trace with hash 905823547, now seen corresponding path program 3 times [2018-06-26 18:41:52,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:41:52,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:41:52,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:52,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:41:52,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:41:52,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:52,472 INFO ]: Checked inductivity of 92 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 18:41:52,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:41:52,473 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:41:52,488 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 18:41:52,597 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 18:41:52,597 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:41:52,605 INFO ]: Computing forward predicates... [2018-06-26 18:41:53,475 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-26 18:41:53,689 WARN ]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-06-26 18:41:54,332 WARN ]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-06-26 18:41:56,265 WARN ]: Spent 605.00 ms on a formula simplification. DAG size of input: 602 DAG size of output: 16 [2018-06-26 18:41:56,633 INFO ]: Checked inductivity of 92 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 18:41:56,653 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:41:56,653 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-06-26 18:41:56,653 INFO ]: Interpolant automaton has 33 states [2018-06-26 18:41:56,653 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 18:41:56,653 INFO ]: CoverageRelationStatistics Valid=73, Invalid=983, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 18:41:56,654 INFO ]: Start difference. First operand 87 states and 133 transitions. Second operand 33 states. [2018-06-26 18:41:57,290 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-06-26 18:41:58,102 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-06-26 18:41:58,457 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-06-26 18:41:58,608 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-06-26 18:41:58,852 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-26 18:41:59,934 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-06-26 18:42:00,531 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-06-26 18:42:01,461 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-06-26 18:42:02,141 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-06-26 18:42:02,696 WARN ]: Spent 361.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2018-06-26 18:42:04,358 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-06-26 18:42:05,071 WARN ]: Spent 105.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 72 [2018-06-26 18:42:05,252 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-06-26 18:42:06,094 WARN ]: Spent 363.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 172 [2018-06-26 18:42:07,994 WARN ]: Spent 375.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 69 [2018-06-26 18:42:09,240 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 65 [2018-06-26 18:42:15,827 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:15,827 INFO ]: Finished difference Result 440 states and 1467 transitions. [2018-06-26 18:42:15,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-06-26 18:42:15,828 INFO ]: Start accepts. Automaton has 33 states. Word has length 42 [2018-06-26 18:42:15,828 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:15,840 INFO ]: With dead ends: 440 [2018-06-26 18:42:15,840 INFO ]: Without dead ends: 432 [2018-06-26 18:42:15,843 INFO ]: 0 DeclaredPredicates, 158 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3974 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1827, Invalid=12215, Unknown=0, NotChecked=0, Total=14042 [2018-06-26 18:42:15,844 INFO ]: Start minimizeSevpa. Operand 432 states. [2018-06-26 18:42:15,940 INFO ]: Finished minimizeSevpa. Reduced states from 432 to 142. [2018-06-26 18:42:15,940 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-26 18:42:15,943 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 253 transitions. [2018-06-26 18:42:15,943 INFO ]: Start accepts. Automaton has 142 states and 253 transitions. Word has length 42 [2018-06-26 18:42:15,943 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:15,943 INFO ]: Abstraction has 142 states and 253 transitions. [2018-06-26 18:42:15,943 INFO ]: Interpolant automaton has 33 states. [2018-06-26 18:42:15,943 INFO ]: Start isEmpty. Operand 142 states and 253 transitions. [2018-06-26 18:42:15,948 INFO ]: Finished isEmpty. Found accepting run of length 49 [2018-06-26 18:42:15,948 INFO ]: Found error trace [2018-06-26 18:42:15,948 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:15,948 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:15,949 INFO ]: Analyzing trace with hash 954872478, now seen corresponding path program 4 times [2018-06-26 18:42:15,949 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:15,949 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:15,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:15,952 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:15,952 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:15,985 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:16,461 WARN ]: Spent 209.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-06-26 18:42:16,833 INFO ]: Checked inductivity of 128 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-26 18:42:16,833 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:42:16,833 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:42:16,838 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 18:42:16,874 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 18:42:16,874 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:42:16,879 INFO ]: Computing forward predicates... [2018-06-26 18:42:18,154 INFO ]: Checked inductivity of 128 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-06-26 18:42:18,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:42:18,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-26 18:42:18,174 INFO ]: Interpolant automaton has 32 states [2018-06-26 18:42:18,174 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 18:42:18,174 INFO ]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2018-06-26 18:42:18,175 INFO ]: Start difference. First operand 142 states and 253 transitions. Second operand 32 states. [2018-06-26 18:42:18,830 WARN ]: Spent 123.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2018-06-26 18:42:18,982 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 15 [2018-06-26 18:42:19,236 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2018-06-26 18:42:19,541 WARN ]: Spent 159.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-06-26 18:42:19,932 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2018-06-26 18:42:20,099 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2018-06-26 18:42:20,240 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-06-26 18:42:20,521 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-06-26 18:42:21,007 WARN ]: Spent 184.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 73 [2018-06-26 18:42:21,243 WARN ]: Spent 201.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 80 [2018-06-26 18:42:21,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:42:21,606 INFO ]: Finished difference Result 254 states and 595 transitions. [2018-06-26 18:42:21,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 18:42:21,606 INFO ]: Start accepts. Automaton has 32 states. Word has length 48 [2018-06-26 18:42:21,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:42:21,611 INFO ]: With dead ends: 254 [2018-06-26 18:42:21,611 INFO ]: Without dead ends: 254 [2018-06-26 18:42:21,612 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=376, Invalid=2276, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 18:42:21,612 INFO ]: Start minimizeSevpa. Operand 254 states. [2018-06-26 18:42:21,631 INFO ]: Finished minimizeSevpa. Reduced states from 254 to 166. [2018-06-26 18:42:21,631 INFO ]: Start removeUnreachable. Operand 166 states. [2018-06-26 18:42:21,637 INFO ]: Finished removeUnreachable. Reduced from 166 states to 166 states and 301 transitions. [2018-06-26 18:42:21,637 INFO ]: Start accepts. Automaton has 166 states and 301 transitions. Word has length 48 [2018-06-26 18:42:21,637 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:42:21,637 INFO ]: Abstraction has 166 states and 301 transitions. [2018-06-26 18:42:21,637 INFO ]: Interpolant automaton has 32 states. [2018-06-26 18:42:21,637 INFO ]: Start isEmpty. Operand 166 states and 301 transitions. [2018-06-26 18:42:21,642 INFO ]: Finished isEmpty. Found accepting run of length 61 [2018-06-26 18:42:21,642 INFO ]: Found error trace [2018-06-26 18:42:21,642 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:42:21,642 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:42:21,642 INFO ]: Analyzing trace with hash -562677084, now seen corresponding path program 5 times [2018-06-26 18:42:21,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:42:21,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:42:21,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:21,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 18:42:21,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:42:21,674 INFO ]: Conjunction of SSA is sat [2018-06-26 18:42:21,679 INFO ]: Counterexample might be feasible [2018-06-26 18:42:21,697 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:42:21,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:42:21 BasicIcfg [2018-06-26 18:42:21,698 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:42:21,699 INFO ]: Toolchain (without parser) took 38540.97 ms. Allocated memory was 302.0 MB in the beginning and 722.5 MB in the end (delta: 420.5 MB). Free memory was 256.4 MB in the beginning and 337.2 MB in the end (delta: -80.9 MB). Peak memory consumption was 339.6 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:21,708 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:42:21,708 INFO ]: ChcToBoogie took 69.08 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 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:42:21,708 INFO ]: Boogie Preprocessor took 42.63 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 252.4 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:42:21,709 INFO ]: RCFGBuilder took 420.28 ms. Allocated memory is still 302.0 MB. Free memory was 252.4 MB in the beginning and 240.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:21,709 INFO ]: BlockEncodingV2 took 116.92 ms. Allocated memory is still 302.0 MB. Free memory was 240.4 MB in the beginning and 234.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:21,709 INFO ]: TraceAbstraction took 37882.07 ms. Allocated memory was 302.0 MB in the beginning and 722.5 MB in the end (delta: 420.5 MB). Free memory was 234.4 MB in the beginning and 337.2 MB in the end (delta: -102.8 MB). Peak memory consumption was 317.7 MB. Max. memory is 3.6 GB. [2018-06-26 18:42:21,712 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 48 edges - StatisticsResult: Encoded RCFG 20 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 69.08 ms. Allocated memory is still 302.0 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.63 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 252.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 420.28 ms. Allocated memory is still 302.0 MB. Free memory was 252.4 MB in the beginning and 240.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 116.92 ms. Allocated memory is still 302.0 MB. Free memory was 240.4 MB in the beginning and 234.4 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 37882.07 ms. Allocated memory was 302.0 MB in the beginning and 722.5 MB in the end (delta: 420.5 MB). Free memory was 234.4 MB in the beginning and 337.2 MB in the end (delta: -102.8 MB). Peak memory consumption was 317.7 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_2_Int <= 1) && !(hbv_False_1_Int <= 0)) && !(hbv_False_1_Int + hbv_False_3_Int == (if hbv_False_2_Int == 10 then 10 else hbv_False_2_Int + hbv_False_4_Int))) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int; [L0] havoc hbv_False_4_Int, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_2_Int)) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] havoc hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == hhv_INV_REC_f^f_1_Int) && hhv_INV_REC_f^f_1_Int <= 1; [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int := hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int; [L0] assume hhv_INV_REC_f__1_0_Int <= 0 && hhv_INV_REC_f__1_1_Int == hhv_INV_REC_f__1_0_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int := hhv_INV_REC_f__1_0_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. UNSAFE Result, 37.8s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 27.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 794 SDtfs, 1231 SDslu, 3512 SDs, 0 SdLazy, 6369 SolverSat, 1334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4667 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 535 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 215423 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 417/617 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/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-42-21-733.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-42-21-733.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-42-21-733.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-42-21-733.csv Received shutdown request...