java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:33:14,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:33:14,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:33:14,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:33:14,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:33:14,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:33:14,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:33:14,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:33:14,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:33:14,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:33:14,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:33:14,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:33:14,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:33:14,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:33:14,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:33:14,819 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:33:14,820 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:33:14,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:33:14,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:33:14,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:33:14,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:33:14,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:33:14,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:33:14,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:33:14,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:33:14,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:33:14,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:33:14,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:33:14,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:33:14,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:33:14,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:33:14,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:33:14,844 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:33:14,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:33:14,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:33:14,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:33:14,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:33:14,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:33:14,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:33:14,875 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:33:14,875 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:33:14,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:33:14,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:33:14,876 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:33:14,876 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:33:14,877 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:33:14,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:33:14,877 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:33:14,877 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:33:14,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:33:14,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:33:14,881 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:33:14,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:33:14,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:33:14,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:33:14,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:33:14,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:33:14,883 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:33:14,884 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:33:14,884 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:33:14,938 INFO ]: Repository-Root is: /tmp [2018-06-26 17:33:14,954 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:33:14,957 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:33:14,958 INFO ]: Initializing SmtParser... [2018-06-26 17:33:14,959 INFO ]: SmtParser initialized [2018-06-26 17:33:14,959 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 [2018-06-26 17:33:14,960 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 17:33:15,036 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 unknown [2018-06-26 17:33:16,137 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 [2018-06-26 17:33:16,142 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:33:16,148 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:33:16,149 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:33:16,149 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:33:16,149 INFO ]: ChcToBoogie initialized [2018-06-26 17:33:16,153 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,282 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16 Unit [2018-06-26 17:33:16,282 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:33:16,283 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:33:16,283 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:33:16,283 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:33:16,305 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,305 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,334 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,334 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,352 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,357 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,362 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (1/1) ... [2018-06-26 17:33:16,369 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:33:16,369 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:33:16,369 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:33:16,369 INFO ]: RCFGBuilder initialized [2018-06-26 17:33:16,370 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:33:16,390 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:33:16,390 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:33:16,390 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:33:16,390 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:33:16,390 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:33:16,390 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 17:33:18,804 INFO ]: Using library mode [2018-06-26 17:33:18,805 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:33:18 BoogieIcfgContainer [2018-06-26 17:33:18,805 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:33:18,806 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:33:18,806 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:33:18,807 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:33:18,807 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:33:18" (1/1) ... [2018-06-26 17:33:18,847 INFO ]: Initial Icfg 144 locations, 287 edges [2018-06-26 17:33:18,848 INFO ]: Using Remove infeasible edges [2018-06-26 17:33:18,849 INFO ]: Using Maximize final states [2018-06-26 17:33:18,849 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:33:18,849 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:33:18,851 INFO ]: Using Remove sink states [2018-06-26 17:33:18,852 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:33:18,852 INFO ]: Using Use SBE [2018-06-26 17:33:18,870 INFO ]: SBE split 0 edges [2018-06-26 17:33:18,879 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 17:33:18,886 INFO ]: 0 new accepting states [2018-06-26 17:33:20,098 INFO ]: Removed 71 edges and 8 locations by large block encoding [2018-06-26 17:33:20,103 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-26 17:33:20,107 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:33:20,108 INFO ]: 0 new accepting states [2018-06-26 17:33:20,112 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:33:20,113 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:33:20,116 INFO ]: Encoded RCFG 133 locations, 275 edges [2018-06-26 17:33:20,117 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:33:20 BasicIcfg [2018-06-26 17:33:20,117 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:33:20,118 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:33:20,118 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:33:20,122 INFO ]: TraceAbstraction initialized [2018-06-26 17:33:20,122 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:33:16" (1/4) ... [2018-06-26 17:33:20,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a603f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:33:20, skipping insertion in model container [2018-06-26 17:33:20,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:33:16" (2/4) ... [2018-06-26 17:33:20,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a603f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:33:20, skipping insertion in model container [2018-06-26 17:33:20,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:33:18" (3/4) ... [2018-06-26 17:33:20,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a603f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:33:20, skipping insertion in model container [2018-06-26 17:33:20,124 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:33:20" (4/4) ... [2018-06-26 17:33:20,127 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:33:20,136 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:33:20,150 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:33:20,186 INFO ]: Using default assertion order modulation [2018-06-26 17:33:20,187 INFO ]: Interprodecural is true [2018-06-26 17:33:20,187 INFO ]: Hoare is false [2018-06-26 17:33:20,187 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:33:20,187 INFO ]: Backedges is TWOTRACK [2018-06-26 17:33:20,187 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:33:20,187 INFO ]: Difference is false [2018-06-26 17:33:20,187 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:33:20,187 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:33:20,202 INFO ]: Start isEmpty. Operand 133 states. [2018-06-26 17:33:20,229 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 17:33:20,229 INFO ]: Found error trace [2018-06-26 17:33:20,230 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 17:33:20,231 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:20,235 INFO ]: Analyzing trace with hash 5691314, now seen corresponding path program 1 times [2018-06-26 17:33:20,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:20,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:20,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:20,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:20,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:20,356 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:20,557 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:33:20,560 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:20,560 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:33:20,562 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:33:20,577 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:33:20,578 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:33:20,581 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-26 17:33:22,577 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:22,578 INFO ]: Finished difference Result 134 states and 372 transitions. [2018-06-26 17:33:22,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:33:22,580 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 17:33:22,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:22,617 INFO ]: With dead ends: 134 [2018-06-26 17:33:22,617 INFO ]: Without dead ends: 134 [2018-06-26 17:33:22,619 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 17:33:22,637 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-26 17:33:22,744 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-26 17:33:22,746 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-26 17:33:22,758 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 372 transitions. [2018-06-26 17:33:22,760 INFO ]: Start accepts. Automaton has 134 states and 372 transitions. Word has length 4 [2018-06-26 17:33:22,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:22,761 INFO ]: Abstraction has 134 states and 372 transitions. [2018-06-26 17:33:22,761 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:33:22,761 INFO ]: Start isEmpty. Operand 134 states and 372 transitions. [2018-06-26 17:33:22,770 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:33:22,771 INFO ]: Found error trace [2018-06-26 17:33:22,771 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:33:22,771 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:22,771 INFO ]: Analyzing trace with hash 175157898, now seen corresponding path program 1 times [2018-06-26 17:33:22,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:22,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:22,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:22,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:22,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:22,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:22,906 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:33:22,906 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:22,906 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:33:22,907 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:33:22,908 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:33:22,908 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:33:22,908 INFO ]: Start difference. First operand 134 states and 372 transitions. Second operand 3 states. [2018-06-26 17:33:25,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:25,326 INFO ]: Finished difference Result 264 states and 548 transitions. [2018-06-26 17:33:25,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:33:25,326 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:33:25,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:25,345 INFO ]: With dead ends: 264 [2018-06-26 17:33:25,345 INFO ]: Without dead ends: 264 [2018-06-26 17:33:25,345 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 17:33:25,346 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-26 17:33:25,406 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-26 17:33:25,406 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-26 17:33:25,416 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 548 transitions. [2018-06-26 17:33:25,416 INFO ]: Start accepts. Automaton has 264 states and 548 transitions. Word has length 5 [2018-06-26 17:33:25,416 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:25,416 INFO ]: Abstraction has 264 states and 548 transitions. [2018-06-26 17:33:25,416 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:33:25,416 INFO ]: Start isEmpty. Operand 264 states and 548 transitions. [2018-06-26 17:33:25,434 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:33:25,434 INFO ]: Found error trace [2018-06-26 17:33:25,434 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:25,434 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:25,434 INFO ]: Analyzing trace with hash 579616269, now seen corresponding path program 1 times [2018-06-26 17:33:25,434 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:25,434 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:25,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:25,435 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:25,435 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:25,491 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:25,825 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:33:25,825 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:25,825 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:33:25,825 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:33:25,826 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:33:25,826 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:33:25,826 INFO ]: Start difference. First operand 264 states and 548 transitions. Second operand 5 states. [2018-06-26 17:33:26,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:26,598 INFO ]: Finished difference Result 408 states and 1133 transitions. [2018-06-26 17:33:26,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:33:26,598 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:33:26,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:26,624 INFO ]: With dead ends: 408 [2018-06-26 17:33:26,624 INFO ]: Without dead ends: 408 [2018-06-26 17:33:26,625 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:33:26,625 INFO ]: Start minimizeSevpa. Operand 408 states. [2018-06-26 17:33:26,734 INFO ]: Finished minimizeSevpa. Reduced states from 408 to 268. [2018-06-26 17:33:26,734 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-26 17:33:26,743 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 574 transitions. [2018-06-26 17:33:26,743 INFO ]: Start accepts. Automaton has 268 states and 574 transitions. Word has length 9 [2018-06-26 17:33:26,743 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:26,743 INFO ]: Abstraction has 268 states and 574 transitions. [2018-06-26 17:33:26,743 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:33:26,743 INFO ]: Start isEmpty. Operand 268 states and 574 transitions. [2018-06-26 17:33:26,758 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:33:26,758 INFO ]: Found error trace [2018-06-26 17:33:26,758 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:26,758 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:26,758 INFO ]: Analyzing trace with hash 579622996, now seen corresponding path program 1 times [2018-06-26 17:33:26,758 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:26,758 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:26,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:26,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:26,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:26,786 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:26,898 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:33:26,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:26,898 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:33:26,899 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:33:26,899 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:33:26,899 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:33:26,899 INFO ]: Start difference. First operand 268 states and 574 transitions. Second operand 5 states. [2018-06-26 17:33:28,136 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:28,136 INFO ]: Finished difference Result 752 states and 2104 transitions. [2018-06-26 17:33:28,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:33:28,137 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:33:28,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:28,200 INFO ]: With dead ends: 752 [2018-06-26 17:33:28,200 INFO ]: Without dead ends: 610 [2018-06-26 17:33:28,200 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:33:28,201 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-26 17:33:28,393 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-26 17:33:28,393 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-26 17:33:28,403 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 855 transitions. [2018-06-26 17:33:28,403 INFO ]: Start accepts. Automaton has 400 states and 855 transitions. Word has length 9 [2018-06-26 17:33:28,403 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:28,403 INFO ]: Abstraction has 400 states and 855 transitions. [2018-06-26 17:33:28,403 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:33:28,403 INFO ]: Start isEmpty. Operand 400 states and 855 transitions. [2018-06-26 17:33:28,423 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:33:28,423 INFO ]: Found error trace [2018-06-26 17:33:28,423 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:28,423 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:28,423 INFO ]: Analyzing trace with hash 579627801, now seen corresponding path program 1 times [2018-06-26 17:33:28,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:28,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:28,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:28,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:28,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:28,468 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:28,662 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:33:28,662 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:28,662 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:33:28,663 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:33:28,663 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:33:28,663 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:33:28,664 INFO ]: Start difference. First operand 400 states and 855 transitions. Second operand 5 states. [2018-06-26 17:33:31,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:31,993 INFO ]: Finished difference Result 610 states and 1690 transitions. [2018-06-26 17:33:31,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:33:31,993 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:33:31,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:32,023 INFO ]: With dead ends: 610 [2018-06-26 17:33:32,026 INFO ]: Without dead ends: 610 [2018-06-26 17:33:32,026 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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 17:33:32,027 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-26 17:33:32,166 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-26 17:33:32,166 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-26 17:33:32,175 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 852 transitions. [2018-06-26 17:33:32,175 INFO ]: Start accepts. Automaton has 400 states and 852 transitions. Word has length 9 [2018-06-26 17:33:32,175 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:32,175 INFO ]: Abstraction has 400 states and 852 transitions. [2018-06-26 17:33:32,175 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:33:32,175 INFO ]: Start isEmpty. Operand 400 states and 852 transitions. [2018-06-26 17:33:32,192 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:33:32,192 INFO ]: Found error trace [2018-06-26 17:33:32,192 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:32,192 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:32,192 INFO ]: Analyzing trace with hash -736865002, now seen corresponding path program 1 times [2018-06-26 17:33:32,192 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:32,192 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:32,194 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:32,194 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:32,216 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:32,311 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:33:32,312 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:32,312 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:33:32,312 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:33:32,312 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:33:32,312 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:33:32,312 INFO ]: Start difference. First operand 400 states and 852 transitions. Second operand 3 states. [2018-06-26 17:33:33,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:33,167 INFO ]: Finished difference Result 532 states and 1133 transitions. [2018-06-26 17:33:33,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:33:33,167 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 17:33:33,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:33,187 INFO ]: With dead ends: 532 [2018-06-26 17:33:33,187 INFO ]: Without dead ends: 532 [2018-06-26 17:33:33,187 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 17:33:33,188 INFO ]: Start minimizeSevpa. Operand 532 states. [2018-06-26 17:33:33,257 INFO ]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-06-26 17:33:33,263 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-26 17:33:33,276 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1133 transitions. [2018-06-26 17:33:33,276 INFO ]: Start accepts. Automaton has 532 states and 1133 transitions. Word has length 9 [2018-06-26 17:33:33,276 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:33,276 INFO ]: Abstraction has 532 states and 1133 transitions. [2018-06-26 17:33:33,276 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:33:33,276 INFO ]: Start isEmpty. Operand 532 states and 1133 transitions. [2018-06-26 17:33:33,302 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:33:33,303 INFO ]: Found error trace [2018-06-26 17:33:33,303 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:33,303 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:33,303 INFO ]: Analyzing trace with hash -781194010, now seen corresponding path program 1 times [2018-06-26 17:33:33,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:33,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:33,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:33,303 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:33,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:33,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:33:33,490 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:33:33,490 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:33:33,490 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:33:33,490 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:33:33,490 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:33:33,490 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:33:33,490 INFO ]: Start difference. First operand 532 states and 1133 transitions. Second operand 5 states. [2018-06-26 17:33:35,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:33:35,870 INFO ]: Finished difference Result 1015 states and 2636 transitions. [2018-06-26 17:33:35,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:33:35,872 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:33:35,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:33:35,912 INFO ]: With dead ends: 1015 [2018-06-26 17:33:35,930 INFO ]: Without dead ends: 1010 [2018-06-26 17:33:35,930 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:33:35,931 INFO ]: Start minimizeSevpa. Operand 1010 states. [2018-06-26 17:33:36,085 INFO ]: Finished minimizeSevpa. Reduced states from 1010 to 790. [2018-06-26 17:33:36,085 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-26 17:33:36,099 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1841 transitions. [2018-06-26 17:33:36,099 INFO ]: Start accepts. Automaton has 790 states and 1841 transitions. Word has length 9 [2018-06-26 17:33:36,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:33:36,100 INFO ]: Abstraction has 790 states and 1841 transitions. [2018-06-26 17:33:36,100 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:33:36,100 INFO ]: Start isEmpty. Operand 790 states and 1841 transitions. [2018-06-26 17:33:36,160 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:33:36,160 INFO ]: Found error trace [2018-06-26 17:33:36,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:33:36,160 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:33:36,160 INFO ]: Analyzing trace with hash 788107831, now seen corresponding path program 1 times [2018-06-26 17:33:36,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:33:36,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:33:36,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:36,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:33:36,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:33:36,211 INFO ]: Conjunction of SSA is sat [2018-06-26 17:33:36,220 INFO ]: Counterexample might be feasible [2018-06-26 17:33:36,234 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:33:36,237 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:33:36 BasicIcfg [2018-06-26 17:33:36,237 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:33:36,238 INFO ]: Toolchain (without parser) took 20095.46 ms. Allocated memory was 321.4 MB in the beginning and 617.6 MB in the end (delta: 296.2 MB). Free memory was 289.5 MB in the beginning and 313.5 MB in the end (delta: -24.0 MB). Peak memory consumption was 272.2 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,239 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:33:36,239 INFO ]: ChcToBoogie took 133.71 ms. Allocated memory is still 321.4 MB. Free memory was 289.5 MB in the beginning and 285.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,240 INFO ]: Boogie Preprocessor took 85.79 ms. Allocated memory is still 321.4 MB. Free memory was 285.1 MB in the beginning and 280.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,241 INFO ]: RCFGBuilder took 2435.94 ms. Allocated memory was 321.4 MB in the beginning and 353.9 MB in the end (delta: 32.5 MB). Free memory was 279.4 MB in the beginning and 274.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,241 INFO ]: BlockEncodingV2 took 1311.84 ms. Allocated memory was 353.9 MB in the beginning and 393.2 MB in the end (delta: 39.3 MB). Free memory was 274.8 MB in the beginning and 342.7 MB in the end (delta: -67.9 MB). Peak memory consumption was 103.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,242 INFO ]: TraceAbstraction took 16118.53 ms. Allocated memory was 393.2 MB in the beginning and 617.6 MB in the end (delta: 224.4 MB). Free memory was 342.7 MB in the beginning and 313.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 253.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:33:36,248 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 287 edges - StatisticsResult: Encoded RCFG 133 locations, 275 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 133.71 ms. Allocated memory is still 321.4 MB. Free memory was 289.5 MB in the beginning and 285.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 85.79 ms. Allocated memory is still 321.4 MB. Free memory was 285.1 MB in the beginning and 280.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2435.94 ms. Allocated memory was 321.4 MB in the beginning and 353.9 MB in the end (delta: 32.5 MB). Free memory was 279.4 MB in the beginning and 274.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1311.84 ms. Allocated memory was 353.9 MB in the beginning and 393.2 MB in the end (delta: 39.3 MB). Free memory was 274.8 MB in the beginning and 342.7 MB in the end (delta: -67.9 MB). Peak memory consumption was 103.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 16118.53 ms. Allocated memory was 393.2 MB in the beginning and 617.6 MB in the end (delta: 224.4 MB). Free memory was 342.7 MB in the beginning and 313.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 253.6 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] RET call gotoProc(1, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int); [L0] hhv_combined_lturn_0_Int, hhv_combined_lturn_1_Int, hhv_combined_lturn_2_Int, hhv_combined_lturn_3_Int, hhv_combined_lturn_4_Int, hhv_combined_lturn_5_Int, hhv_combined_lturn_6_Int, hhv_combined_lturn_7_Int, hhv_combined_lturn_8_Int, hhv_combined_lturn_9_Int, hhv_combined_lturn_10_Int, hhv_combined_lturn_11_Int, hhv_combined_lturn_12_Int, hhv_combined_lturn_13_Int := hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int, hbv_False_10_Int, hbv_False_11_Int, hbv_False_12_Int, hbv_False_13_Int, hbv_False_14_Int; [L0] havoc hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_8_Int, hbv_False_14_Int, hbv_False_2_Int, hbv_False_11_Int, hbv_False_1_Int, hbv_False_7_Int, hbv_False_12_Int, hbv_False_10_Int, hbv_False_13_Int, hbv_False_6_Int, hbv_False_9_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int, hhv_step_lturn_9_Int, hhv_step_lturn_10_Int, hhv_step_lturn_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_13_Int := hhv_lturn_0_Int, hhv_lturn_1_Int, hhv_lturn_2_Int, hhv_lturn_3_Int, hhv_lturn_4_Int, hhv_lturn_5_Int, hhv_lturn_6_Int, hhv_lturn_7_Int, hhv_lturn_8_Int, hhv_lturn_9_Int, hhv_lturn_11_Int, hhv_lturn_12_Int, hhv_lturn_10_Int, hhv_lturn_13_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. UNSAFE Result, 16.0s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 13.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3313 SDtfs, 572 SDslu, 4906 SDs, 0 SdLazy, 3580 SolverSat, 880 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=790occurred in iteration=7, 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.9s AutomataMinimizationTime, 7 MinimizatonAttempts, 780 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 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/incremental-2lists.38.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-33-36-262.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental-2lists.38.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-33-36-262.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental-2lists.38.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-33-36-262.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/incremental-2lists.38.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-33-36-262.csv Received shutdown request...