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.17.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:23:54,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:23:54,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:23:54,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:23:54,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:23:54,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:23:54,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:23:54,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:23:54,216 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:23:54,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:23:54,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:23:54,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:23:54,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:23:54,221 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:23:54,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:23:54,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:23:54,233 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:23:54,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:23:54,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:23:54,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:23:54,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:23:54,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:23:54,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:23:54,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:23:54,244 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:23:54,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:23:54,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:23:54,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:23:54,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:23:54,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:23:54,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:23:54,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:23:54,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:23:54,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:23:54,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:23:54,254 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:23:54,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:23:54,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:23:54,272 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:23:54,272 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:23:54,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:23:54,274 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:23:54,274 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:23:54,274 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:23:54,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:23:54,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:23:54,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:23:54,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:23:54,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:23:54,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:23:54,275 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:23:54,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:23:54,275 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:23:54,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:23:54,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:23:54,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:23:54,277 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:23:54,278 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:23:54,279 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:23:54,331 INFO ]: Repository-Root is: /tmp [2018-06-24 20:23:54,351 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:23:54,358 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:23:54,359 INFO ]: Initializing SmtParser... [2018-06-24 20:23:54,359 INFO ]: SmtParser initialized [2018-06-24 20:23:54,360 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.17.smt2 [2018-06-24 20:23:54,361 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:23:54,453 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.17.smt2 unknown [2018-06-24 20:23:55,112 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full-nonrobust.17.smt2 [2018-06-24 20:23:55,118 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:23:55,124 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:23:55,124 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:23:55,124 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:23:55,125 INFO ]: ChcToBoogie initialized [2018-06-24 20:23:55,131 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,244 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55 Unit [2018-06-24 20:23:55,245 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:23:55,245 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:23:55,245 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:23:55,245 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:23:55,277 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,277 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,299 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,299 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,320 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,325 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,330 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (1/1) ... [2018-06-24 20:23:55,337 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:23:55,338 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:23:55,338 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:23:55,338 INFO ]: RCFGBuilder initialized [2018-06-24 20:23:55,339 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (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:23:55,370 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:23:55,370 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:23:55,370 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:23:55,370 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:23:55,370 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:23:55,370 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:23:57,167 INFO ]: Using library mode [2018-06-24 20:23:57,168 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:23:57 BoogieIcfgContainer [2018-06-24 20:23:57,168 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:23:57,169 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:23:57,169 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:23:57,170 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:23:57,170 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:23:57" (1/1) ... [2018-06-24 20:23:57,219 INFO ]: Initial Icfg 147 locations, 288 edges [2018-06-24 20:23:57,220 INFO ]: Using Remove infeasible edges [2018-06-24 20:23:57,221 INFO ]: Using Maximize final states [2018-06-24 20:23:57,221 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:23:57,221 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:23:57,223 INFO ]: Using Remove sink states [2018-06-24 20:23:57,224 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:23:57,224 INFO ]: Using Use SBE [2018-06-24 20:23:57,238 INFO ]: SBE split 0 edges [2018-06-24 20:23:57,243 INFO ]: Removed 4 edges and 2 locations because of local infeasibility [2018-06-24 20:23:57,245 INFO ]: 0 new accepting states [2018-06-24 20:23:58,077 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-24 20:23:58,082 INFO ]: Removed 5 edges and 2 locations by removing sink states [2018-06-24 20:23:58,100 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:23:58,100 INFO ]: 0 new accepting states [2018-06-24 20:23:58,107 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:23:58,108 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:23:58,112 INFO ]: Encoded RCFG 135 locations, 271 edges [2018-06-24 20:23:58,112 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:23:58 BasicIcfg [2018-06-24 20:23:58,112 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:23:58,113 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:23:58,113 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:23:58,117 INFO ]: TraceAbstraction initialized [2018-06-24 20:23:58,118 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:23:55" (1/4) ... [2018-06-24 20:23:58,118 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1362c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:23:58, skipping insertion in model container [2018-06-24 20:23:58,118 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:23:55" (2/4) ... [2018-06-24 20:23:58,119 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1362c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:23:58, skipping insertion in model container [2018-06-24 20:23:58,119 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:23:57" (3/4) ... [2018-06-24 20:23:58,120 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1362c492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:23:58, skipping insertion in model container [2018-06-24 20:23:58,120 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:23:58" (4/4) ... [2018-06-24 20:23:58,122 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:23:58,133 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:23:58,150 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:23:58,200 INFO ]: Using default assertion order modulation [2018-06-24 20:23:58,201 INFO ]: Interprodecural is true [2018-06-24 20:23:58,201 INFO ]: Hoare is false [2018-06-24 20:23:58,201 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:23:58,201 INFO ]: Backedges is TWOTRACK [2018-06-24 20:23:58,201 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:23:58,201 INFO ]: Difference is false [2018-06-24 20:23:58,201 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:23:58,201 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:23:58,223 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:23:58,293 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:23:58,293 INFO ]: Found error trace [2018-06-24 20:23:58,294 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:23:58,295 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:58,302 INFO ]: Analyzing trace with hash 180739401, now seen corresponding path program 1 times [2018-06-24 20:23:58,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:58,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:58,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:58,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:58,353 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:58,421 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:58,629 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:23:58,632 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:58,632 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:23:58,634 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:23:58,648 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:23:58,648 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:23:58,651 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:24:00,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:00,729 INFO ]: Finished difference Result 267 states and 538 transitions. [2018-06-24 20:24:00,730 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:24:00,731 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:24:00,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:00,794 INFO ]: With dead ends: 267 [2018-06-24 20:24:00,794 INFO ]: Without dead ends: 267 [2018-06-24 20:24:00,799 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:24:00,818 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-24 20:24:00,954 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-06-24 20:24:00,959 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-24 20:24:00,986 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 538 transitions. [2018-06-24 20:24:00,988 INFO ]: Start accepts. Automaton has 267 states and 538 transitions. Word has length 5 [2018-06-24 20:24:00,989 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:00,989 INFO ]: Abstraction has 267 states and 538 transitions. [2018-06-24 20:24:00,989 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:24:00,989 INFO ]: Start isEmpty. Operand 267 states and 538 transitions. [2018-06-24 20:24:00,997 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:24:00,997 INFO ]: Found error trace [2018-06-24 20:24:00,997 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:24:00,998 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:00,998 INFO ]: Analyzing trace with hash 180876824, now seen corresponding path program 1 times [2018-06-24 20:24:00,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:00,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:00,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:00,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:00,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:01,020 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:01,129 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:24:01,129 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:01,129 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:24:01,130 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:24:01,130 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:24:01,130 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:24:01,131 INFO ]: Start difference. First operand 267 states and 538 transitions. Second operand 3 states. [2018-06-24 20:24:03,629 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:03,629 INFO ]: Finished difference Result 399 states and 806 transitions. [2018-06-24 20:24:03,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:24:03,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:24:03,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:03,700 INFO ]: With dead ends: 399 [2018-06-24 20:24:03,700 INFO ]: Without dead ends: 399 [2018-06-24 20:24:03,701 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:24:03,702 INFO ]: Start minimizeSevpa. Operand 399 states. [2018-06-24 20:24:03,792 INFO ]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-06-24 20:24:03,792 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-24 20:24:03,812 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 806 transitions. [2018-06-24 20:24:03,812 INFO ]: Start accepts. Automaton has 399 states and 806 transitions. Word has length 5 [2018-06-24 20:24:03,812 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:03,812 INFO ]: Abstraction has 399 states and 806 transitions. [2018-06-24 20:24:03,812 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:24:03,812 INFO ]: Start isEmpty. Operand 399 states and 806 transitions. [2018-06-24 20:24:03,847 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:03,847 INFO ]: Found error trace [2018-06-24 20:24:03,847 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:03,848 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:03,848 INFO ]: Analyzing trace with hash 1242611476, now seen corresponding path program 1 times [2018-06-24 20:24:03,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:03,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:03,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:03,849 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:03,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:03,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:03,968 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:24:03,968 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:03,968 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:24:03,968 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:24:03,968 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:24:03,968 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:24:03,969 INFO ]: Start difference. First operand 399 states and 806 transitions. Second operand 3 states. [2018-06-24 20:24:05,489 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:05,490 INFO ]: Finished difference Result 531 states and 1073 transitions. [2018-06-24 20:24:05,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:24:05,490 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 20:24:05,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:05,526 INFO ]: With dead ends: 531 [2018-06-24 20:24:05,526 INFO ]: Without dead ends: 531 [2018-06-24 20:24:05,527 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:24:05,527 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-24 20:24:05,597 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 531. [2018-06-24 20:24:05,597 INFO ]: Start removeUnreachable. Operand 531 states. [2018-06-24 20:24:05,614 INFO ]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1073 transitions. [2018-06-24 20:24:05,614 INFO ]: Start accepts. Automaton has 531 states and 1073 transitions. Word has length 10 [2018-06-24 20:24:05,614 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:05,614 INFO ]: Abstraction has 531 states and 1073 transitions. [2018-06-24 20:24:05,614 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:24:05,614 INFO ]: Start isEmpty. Operand 531 states and 1073 transitions. [2018-06-24 20:24:05,658 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:05,658 INFO ]: Found error trace [2018-06-24 20:24:05,658 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:05,658 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:05,658 INFO ]: Analyzing trace with hash 582937140, now seen corresponding path program 1 times [2018-06-24 20:24:05,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:05,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:05,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:05,659 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:05,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:05,691 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:05,800 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:24:05,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:05,800 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:05,800 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:05,800 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:05,800 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:05,800 INFO ]: Start difference. First operand 531 states and 1073 transitions. Second operand 6 states. [2018-06-24 20:24:13,331 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:13,331 INFO ]: Finished difference Result 1564 states and 5886 transitions. [2018-06-24 20:24:13,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:24:13,332 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:13,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:13,532 INFO ]: With dead ends: 1564 [2018-06-24 20:24:13,532 INFO ]: Without dead ends: 1564 [2018-06-24 20:24:13,533 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:24:13,534 INFO ]: Start minimizeSevpa. Operand 1564 states. [2018-06-24 20:24:14,085 INFO ]: Finished minimizeSevpa. Reduced states from 1564 to 1046. [2018-06-24 20:24:14,085 INFO ]: Start removeUnreachable. Operand 1046 states. [2018-06-24 20:24:14,148 INFO ]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2800 transitions. [2018-06-24 20:24:14,148 INFO ]: Start accepts. Automaton has 1046 states and 2800 transitions. Word has length 10 [2018-06-24 20:24:14,148 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:14,148 INFO ]: Abstraction has 1046 states and 2800 transitions. [2018-06-24 20:24:14,148 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:24:14,148 INFO ]: Start isEmpty. Operand 1046 states and 2800 transitions. [2018-06-24 20:24:14,203 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:14,203 INFO ]: Found error trace [2018-06-24 20:24:14,203 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:14,203 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:14,204 INFO ]: Analyzing trace with hash 153499875, now seen corresponding path program 1 times [2018-06-24 20:24:14,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:14,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:14,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:14,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:14,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:14,248 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:14,659 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:24:14,659 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:14,686 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:14,686 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:14,686 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:14,686 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:14,686 INFO ]: Start difference. First operand 1046 states and 2800 transitions. Second operand 6 states. [2018-06-24 20:24:21,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:21,922 INFO ]: Finished difference Result 3205 states and 13944 transitions. [2018-06-24 20:24:21,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:24:21,924 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:21,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:22,289 INFO ]: With dead ends: 3205 [2018-06-24 20:24:22,290 INFO ]: Without dead ends: 3205 [2018-06-24 20:24:22,290 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:24:22,292 INFO ]: Start minimizeSevpa. Operand 3205 states. [2018-06-24 20:24:23,437 INFO ]: Finished minimizeSevpa. Reduced states from 3205 to 2083. [2018-06-24 20:24:23,437 INFO ]: Start removeUnreachable. Operand 2083 states. [2018-06-24 20:24:23,547 INFO ]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 6837 transitions. [2018-06-24 20:24:23,547 INFO ]: Start accepts. Automaton has 2083 states and 6837 transitions. Word has length 10 [2018-06-24 20:24:23,547 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:23,547 INFO ]: Abstraction has 2083 states and 6837 transitions. [2018-06-24 20:24:23,547 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:24:23,547 INFO ]: Start isEmpty. Operand 2083 states and 6837 transitions. [2018-06-24 20:24:23,641 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:23,641 INFO ]: Found error trace [2018-06-24 20:24:23,641 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:23,641 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:23,641 INFO ]: Analyzing trace with hash 239387328, now seen corresponding path program 1 times [2018-06-24 20:24:23,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:23,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:23,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:23,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:23,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:23,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:24,096 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:24:24,097 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:24,097 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:24,097 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:24,097 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:24,097 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:24,097 INFO ]: Start difference. First operand 2083 states and 6837 transitions. Second operand 6 states. [2018-06-24 20:24:30,013 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:30,013 INFO ]: Finished difference Result 4403 states and 21757 transitions. [2018-06-24 20:24:30,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:24:30,014 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:30,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:30,560 INFO ]: With dead ends: 4403 [2018-06-24 20:24:30,560 INFO ]: Without dead ends: 4403 [2018-06-24 20:24:30,560 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:24:30,564 INFO ]: Start minimizeSevpa. Operand 4403 states. [2018-06-24 20:24:32,062 INFO ]: Finished minimizeSevpa. Reduced states from 4403 to 2582. [2018-06-24 20:24:32,062 INFO ]: Start removeUnreachable. Operand 2582 states. [2018-06-24 20:24:34,027 INFO ]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9546 transitions. [2018-06-24 20:24:34,027 INFO ]: Start accepts. Automaton has 2582 states and 9546 transitions. Word has length 10 [2018-06-24 20:24:34,027 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:34,027 INFO ]: Abstraction has 2582 states and 9546 transitions. [2018-06-24 20:24:34,027 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:24:34,027 INFO ]: Start isEmpty. Operand 2582 states and 9546 transitions. [2018-06-24 20:24:34,062 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:34,062 INFO ]: Found error trace [2018-06-24 20:24:34,062 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:34,062 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:34,063 INFO ]: Analyzing trace with hash 1615030828, now seen corresponding path program 1 times [2018-06-24 20:24:34,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:34,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:34,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:34,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:34,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:34,099 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:34,200 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:24:34,200 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:34,200 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:34,200 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:34,200 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:34,200 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:34,200 INFO ]: Start difference. First operand 2582 states and 9546 transitions. Second operand 6 states. [2018-06-24 20:24:38,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:38,192 INFO ]: Finished difference Result 5788 states and 31114 transitions. [2018-06-24 20:24:38,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:24:38,195 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:38,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:38,991 INFO ]: With dead ends: 5788 [2018-06-24 20:24:38,991 INFO ]: Without dead ends: 5291 [2018-06-24 20:24:38,991 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:24:38,994 INFO ]: Start minimizeSevpa. Operand 5291 states. [2018-06-24 20:24:41,203 INFO ]: Finished minimizeSevpa. Reduced states from 5291 to 2958. [2018-06-24 20:24:41,203 INFO ]: Start removeUnreachable. Operand 2958 states. [2018-06-24 20:24:41,360 INFO ]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 11396 transitions. [2018-06-24 20:24:41,360 INFO ]: Start accepts. Automaton has 2958 states and 11396 transitions. Word has length 10 [2018-06-24 20:24:41,360 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:24:41,360 INFO ]: Abstraction has 2958 states and 11396 transitions. [2018-06-24 20:24:41,360 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:24:41,360 INFO ]: Start isEmpty. Operand 2958 states and 11396 transitions. [2018-06-24 20:24:41,411 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:24:41,411 INFO ]: Found error trace [2018-06-24 20:24:41,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:24:41,411 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:24:41,411 INFO ]: Analyzing trace with hash 1615016413, now seen corresponding path program 1 times [2018-06-24 20:24:41,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:24:41,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:24:41,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:41,413 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:24:41,413 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:24:41,435 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:24:41,520 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:24:41,520 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:24:41,520 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:24:41,520 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:24:41,520 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:24:41,520 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:24:41,520 INFO ]: Start difference. First operand 2958 states and 11396 transitions. Second operand 6 states. [2018-06-24 20:24:46,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:24:46,021 INFO ]: Finished difference Result 5658 states and 37097 transitions. [2018-06-24 20:24:46,021 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:24:46,021 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:24:46,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:24:47,093 INFO ]: With dead ends: 5658 [2018-06-24 20:24:47,093 INFO ]: Without dead ends: 5399 [2018-06-24 20:24:47,094 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:24:47,096 INFO ]: Start minimizeSevpa. Operand 5399 states. Received shutdown request... [2018-06-24 20:24:50,248 WARN ]: Verification canceled [2018-06-24 20:24:50,251 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:24:50,252 WARN ]: Timeout [2018-06-24 20:24:50,253 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:24:50 BasicIcfg [2018-06-24 20:24:50,253 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:24:50,253 INFO ]: Toolchain (without parser) took 55135.17 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 223.6 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,255 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:24:50,255 INFO ]: ChcToBoogie took 120.47 ms. Allocated memory is still 304.1 MB. Free memory was 223.6 MB in the beginning and 218.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,255 INFO ]: Boogie Preprocessor took 92.31 ms. Allocated memory is still 304.1 MB. Free memory was 218.6 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,256 INFO ]: RCFGBuilder took 1830.27 ms. Allocated memory was 304.1 MB in the beginning and 321.9 MB in the end (delta: 17.8 MB). Free memory was 215.6 MB in the beginning and 214.7 MB in the end (delta: 929.6 kB). Peak memory consumption was 38.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,256 INFO ]: BlockEncodingV2 took 943.47 ms. Allocated memory was 321.9 MB in the beginning and 364.9 MB in the end (delta: 43.0 MB). Free memory was 214.7 MB in the beginning and 325.6 MB in the end (delta: -110.9 MB). Peak memory consumption was 45.8 MB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,257 INFO ]: TraceAbstraction took 52139.29 ms. Allocated memory was 364.9 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 325.6 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. [2018-06-24 20:24:50,260 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 147 locations, 288 edges - StatisticsResult: Encoded RCFG 135 locations, 271 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 120.47 ms. Allocated memory is still 304.1 MB. Free memory was 223.6 MB in the beginning and 218.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 92.31 ms. Allocated memory is still 304.1 MB. Free memory was 218.6 MB in the beginning and 215.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1830.27 ms. Allocated memory was 304.1 MB in the beginning and 321.9 MB in the end (delta: 17.8 MB). Free memory was 215.6 MB in the beginning and 214.7 MB in the end (delta: 929.6 kB). Peak memory consumption was 38.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 943.47 ms. Allocated memory was 321.9 MB in the beginning and 364.9 MB in the end (delta: 43.0 MB). Free memory was 214.7 MB in the beginning and 325.6 MB in the end (delta: -110.9 MB). Peak memory consumption was 45.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 52139.29 ms. Allocated memory was 364.9 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 325.6 MB in the beginning and 1.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. TIMEOUT Result, 52.0s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 38.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6197 SDtfs, 1087 SDslu, 10501 SDs, 0 SdLazy, 17576 SolverSat, 3561 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2958occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 5794 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 1288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.17.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-24-50-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.17.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-24-50-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.17.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-24-50-272.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full-nonrobust.17.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-24-50-272.csv Completed graceful shutdown