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-14921ce [2018-06-24 20:32:14,664 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:32:14,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:32:14,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:32:14,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:32:14,679 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:32:14,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:32:14,684 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:32:14,685 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:32:14,686 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:32:14,687 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:32:14,687 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:32:14,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:32:14,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:32:14,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:32:14,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:32:14,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:32:14,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:32:14,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:32:14,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:32:14,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:32:14,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:32:14,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:32:14,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:32:14,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:32:14,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:32:14,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:32:14,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:32:14,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:32:14,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:32:14,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:32:14,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:32:14,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:32:14,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:32:14,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:32:14,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:32:14,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:32:14,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:32:14,742 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:32:14,742 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:32:14,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:32:14,744 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:32:14,745 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:32:14,745 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:32:14,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:32:14,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:32:14,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:32:14,746 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:32:14,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:32:14,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:32:14,746 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:32:14,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:32:14,747 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:32:14,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:32:14,747 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:32:14,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:32:14,747 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:32:14,748 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:32:14,749 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:32:14,793 INFO ]: Repository-Root is: /tmp [2018-06-24 20:32:14,807 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:32:14,814 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:32:14,815 INFO ]: Initializing SmtParser... [2018-06-24 20:32:14,815 INFO ]: SmtParser initialized [2018-06-24 20:32:14,816 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 [2018-06-24 20:32:14,817 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:32:14,909 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 unknown [2018-06-24 20:32:15,895 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental-2lists.38.smt2 [2018-06-24 20:32:15,904 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:32:15,909 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:32:15,910 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:32:15,910 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:32:15,910 INFO ]: ChcToBoogie initialized [2018-06-24 20:32:15,913 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:32:15" (1/1) ... [2018-06-24 20:32:16,057 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16 Unit [2018-06-24 20:32:16,057 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:32:16,058 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:32:16,058 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:32:16,058 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:32:16,078 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,078 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,101 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,101 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,133 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,139 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,152 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (1/1) ... [2018-06-24 20:32:16,159 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:32:16,166 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:32:16,166 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:32:16,167 INFO ]: RCFGBuilder initialized [2018-06-24 20:32:16,168 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32: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) [2018-06-24 20:32:16,182 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:32:16,183 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:32:16,183 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:32:16,183 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:32:16,183 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:32:16,183 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:32:18,354 INFO ]: Using library mode [2018-06-24 20:32:18,355 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:32:18 BoogieIcfgContainer [2018-06-24 20:32:18,355 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:32:18,355 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:32:18,355 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:32:18,356 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:32:18,357 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:32:18" (1/1) ... [2018-06-24 20:32:18,408 INFO ]: Initial Icfg 144 locations, 287 edges [2018-06-24 20:32:18,409 INFO ]: Using Remove infeasible edges [2018-06-24 20:32:18,410 INFO ]: Using Maximize final states [2018-06-24 20:32:18,410 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:32:18,410 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:32:18,415 INFO ]: Using Remove sink states [2018-06-24 20:32:18,416 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:32:18,416 INFO ]: Using Use SBE [2018-06-24 20:32:18,439 INFO ]: SBE split 0 edges [2018-06-24 20:32:18,448 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:32:18,451 INFO ]: 0 new accepting states [2018-06-24 20:32:19,577 INFO ]: Removed 71 edges and 8 locations by large block encoding [2018-06-24 20:32:19,581 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:32:19,587 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:32:19,588 INFO ]: 0 new accepting states [2018-06-24 20:32:19,592 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:32:19,593 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:32:19,600 INFO ]: Encoded RCFG 133 locations, 275 edges [2018-06-24 20:32:19,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:32:19 BasicIcfg [2018-06-24 20:32:19,600 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:32:19,601 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:32:19,601 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:32:19,605 INFO ]: TraceAbstraction initialized [2018-06-24 20:32:19,605 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:32:15" (1/4) ... [2018-06-24 20:32:19,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abe608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:32:19, skipping insertion in model container [2018-06-24 20:32:19,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:32:16" (2/4) ... [2018-06-24 20:32:19,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abe608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:32:19, skipping insertion in model container [2018-06-24 20:32:19,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:32:18" (3/4) ... [2018-06-24 20:32:19,606 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75abe608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:32:19, skipping insertion in model container [2018-06-24 20:32:19,606 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:32:19" (4/4) ... [2018-06-24 20:32:19,609 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:32:19,621 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:32:19,629 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:32:19,735 INFO ]: Using default assertion order modulation [2018-06-24 20:32:19,735 INFO ]: Interprodecural is true [2018-06-24 20:32:19,735 INFO ]: Hoare is false [2018-06-24 20:32:19,735 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:32:19,735 INFO ]: Backedges is TWOTRACK [2018-06-24 20:32:19,735 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:32:19,735 INFO ]: Difference is false [2018-06-24 20:32:19,735 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:32:19,735 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:32:19,750 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:32:19,775 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:32:19,775 INFO ]: Found error trace [2018-06-24 20:32:19,776 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:32:19,777 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:19,781 INFO ]: Analyzing trace with hash 5676899, now seen corresponding path program 1 times [2018-06-24 20:32:19,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:19,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:19,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:19,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:19,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:19,905 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:20,104 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:32:20,106 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:20,106 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:32:20,108 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:32:20,122 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:32:20,123 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:20,125 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:32:21,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:21,958 INFO ]: Finished difference Result 134 states and 372 transitions. [2018-06-24 20:32:21,960 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:32:21,961 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:32:21,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:22,004 INFO ]: With dead ends: 134 [2018-06-24 20:32:22,004 INFO ]: Without dead ends: 134 [2018-06-24 20:32:22,006 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:22,025 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:32:22,167 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 20:32:22,169 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:32:22,188 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 372 transitions. [2018-06-24 20:32:22,189 INFO ]: Start accepts. Automaton has 134 states and 372 transitions. Word has length 4 [2018-06-24 20:32:22,190 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:22,190 INFO ]: Abstraction has 134 states and 372 transitions. [2018-06-24 20:32:22,190 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:32:22,190 INFO ]: Start isEmpty. Operand 134 states and 372 transitions. [2018-06-24 20:32:22,208 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:32:22,208 INFO ]: Found error trace [2018-06-24 20:32:22,208 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:32:22,208 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:22,208 INFO ]: Analyzing trace with hash 175160781, now seen corresponding path program 1 times [2018-06-24 20:32:22,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:22,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:22,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:22,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:22,209 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:22,239 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:22,349 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:32:22,349 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:22,349 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:32:22,351 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:32:22,351 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:32:22,351 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:22,351 INFO ]: Start difference. First operand 134 states and 372 transitions. Second operand 3 states. [2018-06-24 20:32:24,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:24,185 INFO ]: Finished difference Result 264 states and 548 transitions. [2018-06-24 20:32:24,186 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:32:24,186 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:32:24,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:24,204 INFO ]: With dead ends: 264 [2018-06-24 20:32:24,204 INFO ]: Without dead ends: 264 [2018-06-24 20:32:24,206 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:24,206 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-24 20:32:24,282 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-24 20:32:24,282 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-24 20:32:24,291 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 548 transitions. [2018-06-24 20:32:24,291 INFO ]: Start accepts. Automaton has 264 states and 548 transitions. Word has length 5 [2018-06-24 20:32:24,292 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:24,292 INFO ]: Abstraction has 264 states and 548 transitions. [2018-06-24 20:32:24,292 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:32:24,292 INFO ]: Start isEmpty. Operand 264 states and 548 transitions. [2018-06-24 20:32:24,306 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:24,306 INFO ]: Found error trace [2018-06-24 20:32:24,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:24,307 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:24,307 INFO ]: Analyzing trace with hash -734099244, now seen corresponding path program 1 times [2018-06-24 20:32:24,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:24,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:24,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:24,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:24,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:24,339 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:24,454 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:24,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:24,455 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:32:24,455 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:32:24,455 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:32:24,455 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:24,455 INFO ]: Start difference. First operand 264 states and 548 transitions. Second operand 3 states. [2018-06-24 20:32:25,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:25,705 INFO ]: Finished difference Result 394 states and 818 transitions. [2018-06-24 20:32:25,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:32:25,706 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:32:25,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:25,727 INFO ]: With dead ends: 394 [2018-06-24 20:32:25,727 INFO ]: Without dead ends: 394 [2018-06-24 20:32:25,727 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:32:25,728 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-24 20:32:25,788 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-24 20:32:25,788 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-24 20:32:25,804 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 818 transitions. [2018-06-24 20:32:25,804 INFO ]: Start accepts. Automaton has 394 states and 818 transitions. Word has length 9 [2018-06-24 20:32:25,804 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:25,804 INFO ]: Abstraction has 394 states and 818 transitions. [2018-06-24 20:32:25,804 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:32:25,804 INFO ]: Start isEmpty. Operand 394 states and 818 transitions. [2018-06-24 20:32:25,834 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:25,834 INFO ]: Found error trace [2018-06-24 20:32:25,834 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:25,834 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:25,834 INFO ]: Analyzing trace with hash -792281067, now seen corresponding path program 1 times [2018-06-24 20:32:25,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:25,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:25,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:25,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:25,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:25,871 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:26,020 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:26,020 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:26,020 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:32:26,020 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:32:26,021 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:32:26,021 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:26,021 INFO ]: Start difference. First operand 394 states and 818 transitions. Second operand 5 states. [2018-06-24 20:32:29,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:29,190 INFO ]: Finished difference Result 843 states and 2172 transitions. [2018-06-24 20:32:29,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:32:29,249 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:32:29,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:29,338 INFO ]: With dead ends: 843 [2018-06-24 20:32:29,338 INFO ]: Without dead ends: 839 [2018-06-24 20:32:29,338 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-24 20:32:29,339 INFO ]: Start minimizeSevpa. Operand 839 states. [2018-06-24 20:32:29,506 INFO ]: Finished minimizeSevpa. Reduced states from 839 to 641. [2018-06-24 20:32:29,506 INFO ]: Start removeUnreachable. Operand 641 states. [2018-06-24 20:32:29,534 INFO ]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1470 transitions. [2018-06-24 20:32:29,535 INFO ]: Start accepts. Automaton has 641 states and 1470 transitions. Word has length 9 [2018-06-24 20:32:29,535 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:29,535 INFO ]: Abstraction has 641 states and 1470 transitions. [2018-06-24 20:32:29,535 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:32:29,535 INFO ]: Start isEmpty. Operand 641 states and 1470 transitions. [2018-06-24 20:32:29,562 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:29,562 INFO ]: Found error trace [2018-06-24 20:32:29,562 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:29,562 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:29,562 INFO ]: Analyzing trace with hash -1468511365, now seen corresponding path program 1 times [2018-06-24 20:32:29,562 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:29,562 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:29,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:29,563 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:29,563 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:29,604 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:29,751 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:29,751 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:29,751 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:32:29,751 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:32:29,751 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:32:29,751 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:29,751 INFO ]: Start difference. First operand 641 states and 1470 transitions. Second operand 5 states. [2018-06-24 20:32:30,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:30,684 INFO ]: Finished difference Result 1283 states and 4162 transitions. [2018-06-24 20:32:30,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:32:30,684 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:32:30,684 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:30,789 INFO ]: With dead ends: 1283 [2018-06-24 20:32:30,789 INFO ]: Without dead ends: 1141 [2018-06-24 20:32:30,789 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-24 20:32:30,790 INFO ]: Start minimizeSevpa. Operand 1141 states. [2018-06-24 20:32:31,053 INFO ]: Finished minimizeSevpa. Reduced states from 1141 to 790. [2018-06-24 20:32:31,054 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-24 20:32:31,085 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1876 transitions. [2018-06-24 20:32:31,085 INFO ]: Start accepts. Automaton has 790 states and 1876 transitions. Word has length 9 [2018-06-24 20:32:31,086 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:31,086 INFO ]: Abstraction has 790 states and 1876 transitions. [2018-06-24 20:32:31,086 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:32:31,086 INFO ]: Start isEmpty. Operand 790 states and 1876 transitions. [2018-06-24 20:32:31,119 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:31,119 INFO ]: Found error trace [2018-06-24 20:32:31,119 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:31,119 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:31,119 INFO ]: Analyzing trace with hash -1468510404, now seen corresponding path program 1 times [2018-06-24 20:32:31,119 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:31,119 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:31,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:31,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:31,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:31,152 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:31,320 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:31,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:31,320 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:32:31,320 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:32:31,320 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:32:31,320 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:31,320 INFO ]: Start difference. First operand 790 states and 1876 transitions. Second operand 5 states. [2018-06-24 20:32:33,186 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:33,186 INFO ]: Finished difference Result 1141 states and 3668 transitions. [2018-06-24 20:32:33,187 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:32:33,187 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:32:33,187 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:33,279 INFO ]: With dead ends: 1141 [2018-06-24 20:32:33,279 INFO ]: Without dead ends: 1141 [2018-06-24 20:32:33,280 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:33,281 INFO ]: Start minimizeSevpa. Operand 1141 states. [2018-06-24 20:32:33,562 INFO ]: Finished minimizeSevpa. Reduced states from 1141 to 790. [2018-06-24 20:32:33,562 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-24 20:32:33,590 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1851 transitions. [2018-06-24 20:32:33,590 INFO ]: Start accepts. Automaton has 790 states and 1851 transitions. Word has length 9 [2018-06-24 20:32:33,590 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:33,590 INFO ]: Abstraction has 790 states and 1851 transitions. [2018-06-24 20:32:33,590 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:32:33,590 INFO ]: Start isEmpty. Operand 790 states and 1851 transitions. [2018-06-24 20:32:33,616 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:33,616 INFO ]: Found error trace [2018-06-24 20:32:33,616 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:33,616 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:33,616 INFO ]: Analyzing trace with hash -1468509443, now seen corresponding path program 1 times [2018-06-24 20:32:33,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:33,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:33,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:33,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:33,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:33,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:33,911 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:33,911 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:33,911 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:32:33,911 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:32:33,911 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:32:33,911 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:33,911 INFO ]: Start difference. First operand 790 states and 1851 transitions. Second operand 5 states. [2018-06-24 20:32:36,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:36,275 INFO ]: Finished difference Result 1141 states and 3663 transitions. [2018-06-24 20:32:36,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:32:36,276 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:32:36,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:36,350 INFO ]: With dead ends: 1141 [2018-06-24 20:32:36,350 INFO ]: Without dead ends: 1141 [2018-06-24 20:32:36,351 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-24 20:32:36,352 INFO ]: Start minimizeSevpa. Operand 1141 states. [2018-06-24 20:32:36,649 INFO ]: Finished minimizeSevpa. Reduced states from 1141 to 790. [2018-06-24 20:32:36,649 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-24 20:32:36,679 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1846 transitions. [2018-06-24 20:32:36,679 INFO ]: Start accepts. Automaton has 790 states and 1846 transitions. Word has length 9 [2018-06-24 20:32:36,679 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:36,679 INFO ]: Abstraction has 790 states and 1846 transitions. [2018-06-24 20:32:36,679 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:32:36,679 INFO ]: Start isEmpty. Operand 790 states and 1846 transitions. [2018-06-24 20:32:36,701 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:32:36,701 INFO ]: Found error trace [2018-06-24 20:32:36,701 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:36,701 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:36,702 INFO ]: Analyzing trace with hash -1468503677, now seen corresponding path program 1 times [2018-06-24 20:32:36,702 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:36,702 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:36,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:36,702 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:36,702 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:36,741 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:32:37,021 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:32:37,021 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:32:37,021 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:32:37,021 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:32:37,021 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:32:37,021 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:32:37,022 INFO ]: Start difference. First operand 790 states and 1846 transitions. Second operand 5 states. [2018-06-24 20:32:38,474 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:38,474 INFO ]: Finished difference Result 1141 states and 3658 transitions. [2018-06-24 20:32:38,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:32:38,474 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:32:38,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:32:38,543 INFO ]: With dead ends: 1141 [2018-06-24 20:32:38,543 INFO ]: Without dead ends: 1141 [2018-06-24 20:32:38,543 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-24 20:32:38,544 INFO ]: Start minimizeSevpa. Operand 1141 states. [2018-06-24 20:32:38,791 INFO ]: Finished minimizeSevpa. Reduced states from 1141 to 790. [2018-06-24 20:32:38,791 INFO ]: Start removeUnreachable. Operand 790 states. [2018-06-24 20:32:38,814 INFO ]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1841 transitions. [2018-06-24 20:32:38,814 INFO ]: Start accepts. Automaton has 790 states and 1841 transitions. Word has length 9 [2018-06-24 20:32:38,814 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:32:38,814 INFO ]: Abstraction has 790 states and 1841 transitions. [2018-06-24 20:32:38,814 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:32:38,814 INFO ]: Start isEmpty. Operand 790 states and 1841 transitions. [2018-06-24 20:32:38,836 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:32:38,836 INFO ]: Found error trace [2018-06-24 20:32:38,836 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:32:38,836 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:32:38,837 INFO ]: Analyzing trace with hash 1212465046, now seen corresponding path program 1 times [2018-06-24 20:32:38,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:32:38,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:32:38,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:38,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:32:38,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:32:38,891 INFO ]: Conjunction of SSA is sat [2018-06-24 20:32:38,911 INFO ]: Counterexample might be feasible [2018-06-24 20:32:38,923 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:32:38,926 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:32:38 BasicIcfg [2018-06-24 20:32:38,926 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:32:38,927 INFO ]: Toolchain (without parser) took 23022.22 ms. Allocated memory was 326.1 MB in the beginning and 711.5 MB in the end (delta: 385.4 MB). Free memory was 295.5 MB in the beginning and 592.3 MB in the end (delta: -296.8 MB). Peak memory consumption was 88.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:32:38,928 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:32:38,928 INFO ]: ChcToBoogie took 148.02 ms. Allocated memory is still 326.1 MB. Free memory was 295.5 MB in the beginning and 290.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:32:38,930 INFO ]: Boogie Preprocessor took 100.52 ms. Allocated memory is still 326.1 MB. Free memory was 290.9 MB in the beginning and 286.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:32:38,930 INFO ]: RCFGBuilder took 2188.21 ms. Allocated memory was 326.1 MB in the beginning and 363.3 MB in the end (delta: 37.2 MB). Free memory was 286.3 MB in the beginning and 290.7 MB in the end (delta: -4.4 MB). Peak memory consumption was 115.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:32:38,931 INFO ]: BlockEncodingV2 took 1245.22 ms. Allocated memory is still 363.3 MB. Free memory was 290.0 MB in the beginning and 176.8 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:32:38,931 INFO ]: TraceAbstraction took 19324.36 ms. Allocated memory was 363.3 MB in the beginning and 711.5 MB in the end (delta: 348.1 MB). Free memory was 176.8 MB in the beginning and 592.3 MB in the end (delta: -415.6 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:32:38,938 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.07 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 148.02 ms. Allocated memory is still 326.1 MB. Free memory was 295.5 MB in the beginning and 290.9 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 100.52 ms. Allocated memory is still 326.1 MB. Free memory was 290.9 MB in the beginning and 286.3 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2188.21 ms. Allocated memory was 326.1 MB in the beginning and 363.3 MB in the end (delta: 37.2 MB). Free memory was 286.3 MB in the beginning and 290.7 MB in the end (delta: -4.4 MB). Peak memory consumption was 115.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1245.22 ms. Allocated memory is still 363.3 MB. Free memory was 290.0 MB in the beginning and 176.8 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19324.36 ms. Allocated memory was 363.3 MB in the beginning and 711.5 MB in the end (delta: 348.1 MB). Free memory was 176.8 MB in the beginning and 592.3 MB in the end (delta: -415.6 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(6, 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] COND TRUE gotoSwitch == 6 [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 := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int, gpav_9_Int, gpav_10_Int, gpav_11_Int, gpav_12_Int, gpav_13_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_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_11_Int, hhv_step_lturn_12_Int, hhv_step_lturn_10_Int, hhv_step_lturn_13_Int; [L0] RET call gotoProc(6, 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(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, 19.1s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4058 SDtfs, 707 SDslu, 6265 SDs, 0 SdLazy, 4124 SolverSat, 1062 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=790occurred in iteration=5, 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: 1.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 1602 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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-24_20-32-38-948.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-24_20-32-38-948.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-24_20-32-38-948.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-24_20-32-38-948.csv Received shutdown request...