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/fortune-full-nonrobust.21.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:25:10,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:25:10,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:25:10,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:25:10,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:25:10,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:25:10,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:25:10,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:25:10,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:25:10,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:25:10,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:25:10,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:25:10,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:25:10,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:25:10,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:25:10,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:25:10,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:25:10,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:25:10,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:25:10,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:25:10,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:25:10,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:25:10,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:25:10,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:25:10,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:25:10,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:25:10,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:25:10,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:25:10,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:25:10,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:25:10,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:25:10,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:25:10,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:25:10,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:25:10,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:25:10,062 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:25:10,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:25:10,078 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:25:10,078 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:25:10,078 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:25:10,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:25:10,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:25:10,080 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:25:10,080 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:25:10,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:25:10,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:25:10,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:25:10,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:25:10,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:25:10,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:25:10,082 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:25:10,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:25:10,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:25:10,083 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:25:10,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:25:10,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:25:10,084 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:25:10,085 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:25:10,086 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:25:10,132 INFO ]: Repository-Root is: /tmp [2018-06-24 20:25:10,150 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:25:10,153 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:25:10,155 INFO ]: Initializing SmtParser... [2018-06-24 20:25:10,155 INFO ]: SmtParser initialized [2018-06-24 20:25:10,155 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 [2018-06-24 20:25:10,157 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:25:10,233 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 unknown [2018-06-24 20:25:10,873 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.21.smt2 [2018-06-24 20:25:10,880 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:25:10,886 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:25:10,887 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:25:10,887 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:25:10,887 INFO ]: ChcToBoogie initialized [2018-06-24 20:25:10,894 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:25:10" (1/1) ... [2018-06-24 20:25:11,011 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11 Unit [2018-06-24 20:25:11,011 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:25:11,012 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:25:11,012 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:25:11,012 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:25:11,032 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,032 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,054 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,054 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,079 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,089 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,096 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (1/1) ... [2018-06-24 20:25:11,103 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:25:11,104 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:25:11,104 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:25:11,104 INFO ]: RCFGBuilder initialized [2018-06-24 20:25:11,105 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (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:25:11,123 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:25:11,123 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:25:11,123 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:25:11,123 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:25:11,124 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:25:11,124 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:25:12,960 INFO ]: Using library mode [2018-06-24 20:25:12,961 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:25:12 BoogieIcfgContainer [2018-06-24 20:25:12,961 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:25:12,961 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:25:12,961 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:25:12,966 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:25:12,966 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:25:12" (1/1) ... [2018-06-24 20:25:13,015 INFO ]: Initial Icfg 147 locations, 285 edges [2018-06-24 20:25:13,017 INFO ]: Using Remove infeasible edges [2018-06-24 20:25:13,017 INFO ]: Using Maximize final states [2018-06-24 20:25:13,018 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:25:13,018 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:25:13,022 INFO ]: Using Remove sink states [2018-06-24 20:25:13,022 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:25:13,023 INFO ]: Using Use SBE [2018-06-24 20:25:13,041 INFO ]: SBE split 0 edges [2018-06-24 20:25:13,053 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 20:25:13,055 INFO ]: 0 new accepting states [2018-06-24 20:25:13,737 INFO ]: Removed 49 edges and 8 locations by large block encoding [2018-06-24 20:25:13,740 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-24 20:25:13,745 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:25:13,745 INFO ]: 0 new accepting states [2018-06-24 20:25:13,752 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:25:13,753 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:25:13,760 INFO ]: Encoded RCFG 135 locations, 268 edges [2018-06-24 20:25:13,761 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:25:13 BasicIcfg [2018-06-24 20:25:13,761 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:25:13,762 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:25:13,762 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:25:13,768 INFO ]: TraceAbstraction initialized [2018-06-24 20:25:13,768 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:25:10" (1/4) ... [2018-06-24 20:25:13,769 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224ca1d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:25:13, skipping insertion in model container [2018-06-24 20:25:13,769 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:25:11" (2/4) ... [2018-06-24 20:25:13,769 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224ca1d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:25:13, skipping insertion in model container [2018-06-24 20:25:13,769 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:25:12" (3/4) ... [2018-06-24 20:25:13,771 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224ca1d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:25:13, skipping insertion in model container [2018-06-24 20:25:13,771 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:25:13" (4/4) ... [2018-06-24 20:25:13,773 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:25:13,784 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:25:13,793 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:25:13,848 INFO ]: Using default assertion order modulation [2018-06-24 20:25:13,849 INFO ]: Interprodecural is true [2018-06-24 20:25:13,849 INFO ]: Hoare is false [2018-06-24 20:25:13,849 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:25:13,849 INFO ]: Backedges is TWOTRACK [2018-06-24 20:25:13,849 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:25:13,849 INFO ]: Difference is false [2018-06-24 20:25:13,849 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:25:13,849 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:25:13,865 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:25:13,941 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:25:13,941 INFO ]: Found error trace [2018-06-24 20:25:13,943 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:25:13,943 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:13,948 INFO ]: Analyzing trace with hash 177933495, now seen corresponding path program 1 times [2018-06-24 20:25:13,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:13,951 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:13,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:13,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:13,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:14,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:14,297 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:25:14,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:14,300 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:25:14,302 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:25:14,318 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:25:14,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:25:14,320 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:25:16,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:16,580 INFO ]: Finished difference Result 267 states and 532 transitions. [2018-06-24 20:25:16,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:25:16,584 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:25:16,585 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:16,648 INFO ]: With dead ends: 267 [2018-06-24 20:25:16,648 INFO ]: Without dead ends: 267 [2018-06-24 20:25:16,650 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:25:16,669 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:25:16,788 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:25:16,789 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:25:16,809 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 532 transitions. [2018-06-24 20:25:16,811 INFO ]: Start accepts. Automaton has 267 states and 532 transitions. Word has length 5 [2018-06-24 20:25:16,811 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:16,811 INFO ]: Abstraction has 267 states and 532 transitions. [2018-06-24 20:25:16,811 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:25:16,812 INFO ]: Start isEmpty. Operand 267 states and 532 transitions. [2018-06-24 20:25:16,822 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:25:16,822 INFO ]: Found error trace [2018-06-24 20:25:16,822 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:25:16,822 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:16,822 INFO ]: Analyzing trace with hash 177967130, now seen corresponding path program 1 times [2018-06-24 20:25:16,822 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:16,822 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:16,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:16,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:16,824 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:16,869 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:17,027 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:25:17,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:17,027 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:25:17,029 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:25:17,029 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:25:17,029 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:25:17,029 INFO ]: Start difference. First operand 267 states and 532 transitions. Second operand 3 states. [2018-06-24 20:25:19,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:19,286 INFO ]: Finished difference Result 399 states and 797 transitions. [2018-06-24 20:25:19,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:25:19,287 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:25:19,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:19,321 INFO ]: With dead ends: 399 [2018-06-24 20:25:19,321 INFO ]: Without dead ends: 399 [2018-06-24 20:25:19,322 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:25:19,323 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:25:19,416 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:25:19,417 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:25:19,434 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 797 transitions. [2018-06-24 20:25:19,434 INFO ]: Start accepts. Automaton has 399 states and 797 transitions. Word has length 5 [2018-06-24 20:25:19,434 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:19,434 INFO ]: Abstraction has 399 states and 797 transitions. [2018-06-24 20:25:19,434 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:25:19,434 INFO ]: Start isEmpty. Operand 399 states and 797 transitions. [2018-06-24 20:25:19,471 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:19,471 INFO ]: Found error trace [2018-06-24 20:25:19,471 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:19,471 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:19,472 INFO ]: Analyzing trace with hash -307468306, now seen corresponding path program 1 times [2018-06-24 20:25:19,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:19,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:19,472 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:19,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:19,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:19,530 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:19,743 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:25:19,743 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:19,743 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:25:19,743 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:25:19,743 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:25:19,744 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:25:19,744 INFO ]: Start difference. First operand 399 states and 797 transitions. Second operand 6 states. [2018-06-24 20:25:28,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:28,338 INFO ]: Finished difference Result 1368 states and 5103 transitions. [2018-06-24 20:25:28,339 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:25:28,339 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:25:28,339 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:28,612 INFO ]: With dead ends: 1368 [2018-06-24 20:25:28,612 INFO ]: Without dead ends: 1368 [2018-06-24 20:25:28,613 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:25:28,615 INFO ]: Start minimizeSevpa. Operand 1368 states. [2018-06-24 20:25:29,080 INFO ]: Finished minimizeSevpa. Reduced states from 1368 to 829. [2018-06-24 20:25:29,080 INFO ]: Start removeUnreachable. Operand 829 states. [2018-06-24 20:25:29,190 INFO ]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2205 transitions. [2018-06-24 20:25:29,190 INFO ]: Start accepts. Automaton has 829 states and 2205 transitions. Word has length 10 [2018-06-24 20:25:29,190 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:29,190 INFO ]: Abstraction has 829 states and 2205 transitions. [2018-06-24 20:25:29,190 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:29,190 INFO ]: Start isEmpty. Operand 829 states and 2205 transitions. [2018-06-24 20:25:29,249 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:29,250 INFO ]: Found error trace [2018-06-24 20:25:29,250 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:29,250 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:29,250 INFO ]: Analyzing trace with hash -164322551, now seen corresponding path program 1 times [2018-06-24 20:25:29,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:29,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:29,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:29,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:29,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:29,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:29,635 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:25:29,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:29,635 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:25:29,635 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:25:29,636 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:25:29,636 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:25:29,636 INFO ]: Start difference. First operand 829 states and 2205 transitions. Second operand 6 states. [2018-06-24 20:25:34,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:34,948 INFO ]: Finished difference Result 2177 states and 9326 transitions. [2018-06-24 20:25:34,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:25:34,948 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:25:34,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:35,185 INFO ]: With dead ends: 2177 [2018-06-24 20:25:35,185 INFO ]: Without dead ends: 2177 [2018-06-24 20:25:35,185 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:25:35,187 INFO ]: Start minimizeSevpa. Operand 2177 states. [2018-06-24 20:25:35,932 INFO ]: Finished minimizeSevpa. Reduced states from 2177 to 829. [2018-06-24 20:25:35,932 INFO ]: Start removeUnreachable. Operand 829 states. [2018-06-24 20:25:35,978 INFO ]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2205 transitions. [2018-06-24 20:25:35,978 INFO ]: Start accepts. Automaton has 829 states and 2205 transitions. Word has length 10 [2018-06-24 20:25:35,978 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:35,978 INFO ]: Abstraction has 829 states and 2205 transitions. [2018-06-24 20:25:35,978 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:35,978 INFO ]: Start isEmpty. Operand 829 states and 2205 transitions. [2018-06-24 20:25:36,019 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:36,019 INFO ]: Found error trace [2018-06-24 20:25:36,020 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:36,020 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:36,021 INFO ]: Analyzing trace with hash 1793285400, now seen corresponding path program 1 times [2018-06-24 20:25:36,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:36,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:36,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:36,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:36,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:36,071 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:36,495 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:25:36,495 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:36,495 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:25:36,495 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:25:36,495 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:25:36,495 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:25:36,495 INFO ]: Start difference. First operand 829 states and 2205 transitions. Second operand 6 states. [2018-06-24 20:25:40,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:40,805 INFO ]: Finished difference Result 2250 states and 8610 transitions. [2018-06-24 20:25:40,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:25:40,805 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:25:40,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:41,035 INFO ]: With dead ends: 2250 [2018-06-24 20:25:41,035 INFO ]: Without dead ends: 2046 [2018-06-24 20:25:41,035 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:25:41,037 INFO ]: Start minimizeSevpa. Operand 2046 states. [2018-06-24 20:25:41,749 INFO ]: Finished minimizeSevpa. Reduced states from 2046 to 1273. [2018-06-24 20:25:41,749 INFO ]: Start removeUnreachable. Operand 1273 states. [2018-06-24 20:25:41,843 INFO ]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 3598 transitions. [2018-06-24 20:25:41,843 INFO ]: Start accepts. Automaton has 1273 states and 3598 transitions. Word has length 10 [2018-06-24 20:25:41,843 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:41,843 INFO ]: Abstraction has 1273 states and 3598 transitions. [2018-06-24 20:25:41,843 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:25:41,843 INFO ]: Start isEmpty. Operand 1273 states and 3598 transitions. [2018-06-24 20:25:41,892 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:25:41,892 INFO ]: Found error trace [2018-06-24 20:25:41,892 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:41,892 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:41,893 INFO ]: Analyzing trace with hash -850812958, now seen corresponding path program 1 times [2018-06-24 20:25:41,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:41,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:41,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:41,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:41,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:41,923 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:25:42,032 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:25:42,032 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:25:42,032 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:25:42,032 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:25:42,032 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:25:42,032 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:25:42,032 INFO ]: Start difference. First operand 1273 states and 3598 transitions. Second operand 3 states. [2018-06-24 20:25:43,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:25:43,741 INFO ]: Finished difference Result 1441 states and 4061 transitions. [2018-06-24 20:25:43,741 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:25:43,741 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:25:43,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:25:43,817 INFO ]: With dead ends: 1441 [2018-06-24 20:25:43,817 INFO ]: Without dead ends: 1441 [2018-06-24 20:25:43,818 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:25:43,819 INFO ]: Start minimizeSevpa. Operand 1441 states. [2018-06-24 20:25:44,086 INFO ]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2018-06-24 20:25:44,087 INFO ]: Start removeUnreachable. Operand 1441 states. [2018-06-24 20:25:44,163 INFO ]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 4061 transitions. [2018-06-24 20:25:44,164 INFO ]: Start accepts. Automaton has 1441 states and 4061 transitions. Word has length 10 [2018-06-24 20:25:44,164 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:25:44,164 INFO ]: Abstraction has 1441 states and 4061 transitions. [2018-06-24 20:25:44,164 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:25:44,164 INFO ]: Start isEmpty. Operand 1441 states and 4061 transitions. [2018-06-24 20:25:44,352 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:25:44,352 INFO ]: Found error trace [2018-06-24 20:25:44,352 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:25:44,352 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:25:44,353 INFO ]: Analyzing trace with hash -427915956, now seen corresponding path program 1 times [2018-06-24 20:25:44,353 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:25:44,353 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:25:44,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:44,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:25:44,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:25:44,399 INFO ]: Conjunction of SSA is sat [2018-06-24 20:25:44,411 INFO ]: Counterexample might be feasible [2018-06-24 20:25:44,423 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:25:44,426 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:25:44 BasicIcfg [2018-06-24 20:25:44,426 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:25:44,427 INFO ]: Toolchain (without parser) took 33546.29 ms. Allocated memory was 306.2 MB in the beginning and 1.1 GB in the end (delta: 778.6 MB). Free memory was 226.7 MB in the beginning and 852.5 MB in the end (delta: -625.8 MB). Peak memory consumption was 152.7 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,431 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:25:44,432 INFO ]: ChcToBoogie took 124.44 ms. Allocated memory is still 306.2 MB. Free memory was 226.7 MB in the beginning and 220.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,432 INFO ]: Boogie Preprocessor took 91.48 ms. Allocated memory is still 306.2 MB. Free memory was 220.7 MB in the beginning and 218.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,432 INFO ]: RCFGBuilder took 1856.81 ms. Allocated memory was 306.2 MB in the beginning and 322.4 MB in the end (delta: 16.3 MB). Free memory was 218.7 MB in the beginning and 224.1 MB in the end (delta: -5.4 MB). Peak memory consumption was 39.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,433 INFO ]: BlockEncodingV2 took 799.74 ms. Allocated memory is still 322.4 MB. Free memory was 224.1 MB in the beginning and 175.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,433 INFO ]: TraceAbstraction took 30663.48 ms. Allocated memory was 322.4 MB in the beginning and 1.1 GB in the end (delta: 762.3 MB). Free memory was 175.8 MB in the beginning and 852.5 MB in the end (delta: -676.7 MB). Peak memory consumption was 85.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:25:44,441 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 285 edges - StatisticsResult: Encoded RCFG 135 locations, 268 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 306.2 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 124.44 ms. Allocated memory is still 306.2 MB. Free memory was 226.7 MB in the beginning and 220.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 91.48 ms. Allocated memory is still 306.2 MB. Free memory was 220.7 MB in the beginning and 218.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1856.81 ms. Allocated memory was 306.2 MB in the beginning and 322.4 MB in the end (delta: 16.3 MB). Free memory was 218.7 MB in the beginning and 224.1 MB in the end (delta: -5.4 MB). Peak memory consumption was 39.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 799.74 ms. Allocated memory is still 322.4 MB. Free memory was 224.1 MB in the beginning and 175.8 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30663.48 ms. Allocated memory was 322.4 MB in the beginning and 1.1 GB in the end (delta: 762.3 MB). Free memory was 175.8 MB in the beginning and 852.5 MB in the end (delta: -676.7 MB). Peak memory consumption was 85.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(2, 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 == 2 [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 := 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_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; [L0] RET call gotoProc(2, 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_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 := 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_13_Int, hbv_False_12_Int, hbv_False_14_Int; [L0] havoc hbv_False_2_Int, hbv_False_14_Int, hbv_False_6_Int, hbv_False_3_Int, hbv_False_7_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_8_Int, hbv_False_10_Int, hbv_False_9_Int, hbv_False_11_Int, hbv_False_13_Int, hbv_False_12_Int, hbv_False_1_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, 135 locations, 1 error locations. UNSAFE Result, 30.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3890 SDtfs, 756 SDslu, 6204 SDs, 0 SdLazy, 9234 SolverSat, 2686 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1441occurred in iteration=6, 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: 2.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 2660 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 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/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-25-44-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-25-44-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-25-44-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.21.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-25-44-457.csv Received shutdown request...