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/vmt-chc-benchmarks/ctigar/svd.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:59:31,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:59:31,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:59:31,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:59:31,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:59:31,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:59:31,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:59:31,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:59:31,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:59:31,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:59:31,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:59:31,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:59:31,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:59:31,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:59:31,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:59:31,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:59:31,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:59:31,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:59:31,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:59:31,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:59:31,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:59:31,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:59:31,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:59:31,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:59:31,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:59:31,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:59:31,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:59:31,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:59:31,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:59:31,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:59:31,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:59:31,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:59:31,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:59:31,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:59:31,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:59:31,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:59:31,399 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:59:31,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:59:31,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:59:31,427 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:59:31,427 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:59:31,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:59:31,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:59:31,430 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:59:31,430 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:59:31,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:59:31,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:59:31,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:59:31,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:59:31,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:59:31,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:59:31,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:59:31,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:59:31,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:59:31,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:59:31,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:59:31,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:59:31,433 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:59:31,434 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:59:31,435 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:59:31,477 INFO ]: Repository-Root is: /tmp [2018-06-26 21:59:31,493 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:59:31,498 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:59:31,499 INFO ]: Initializing SmtParser... [2018-06-26 21:59:31,500 INFO ]: SmtParser initialized [2018-06-26 21:59:31,500 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd.c.smt2 [2018-06-26 21:59:31,502 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 21:59:31,594 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd.c.smt2 unknown [2018-06-26 21:59:32,709 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/svd.c.smt2 [2018-06-26 21:59:32,714 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:59:32,721 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:59:32,721 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:59:32,721 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:59:32,722 INFO ]: ChcToBoogie initialized [2018-06-26 21:59:32,725 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,803 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32 Unit [2018-06-26 21:59:32,803 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:59:32,804 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:59:32,804 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:59:32,804 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:59:32,832 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,832 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,869 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,870 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,901 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,903 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,913 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... [2018-06-26 21:59:32,921 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:59:32,921 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:59:32,921 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:59:32,921 INFO ]: RCFGBuilder initialized [2018-06-26 21:59:32,923 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:59:32,940 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:59:32,940 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:59:32,941 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:59:32,941 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:59:32,941 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:59:32,941 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:59:33,697 INFO ]: Using library mode [2018-06-26 21:59:33,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:59:33 BoogieIcfgContainer [2018-06-26 21:59:33,698 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:59:33,698 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:59:33,698 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:59:33,700 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:59:33,701 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:59:33" (1/1) ... [2018-06-26 21:59:33,721 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:59:33,722 INFO ]: Using Remove infeasible edges [2018-06-26 21:59:33,724 INFO ]: Using Maximize final states [2018-06-26 21:59:33,724 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:59:33,724 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:59:33,726 INFO ]: Using Remove sink states [2018-06-26 21:59:33,726 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:59:33,726 INFO ]: Using Use SBE [2018-06-26 21:59:33,742 WARN ]: expecting exponential blowup for input size 10 [2018-06-26 21:59:34,880 WARN ]: aborting because of expected exponential blowup for input size 515 [2018-06-26 21:59:34,919 WARN ]: aborting because of expected exponential blowup for input size 515 [2018-06-26 21:59:34,919 INFO ]: SBE split 1 edges [2018-06-26 21:59:34,928 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:59:34,929 INFO ]: 0 new accepting states [2018-06-26 21:59:36,067 INFO ]: Removed 99 edges and 2 locations by large block encoding [2018-06-26 21:59:36,069 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:59:36,071 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:59:36,071 INFO ]: 0 new accepting states [2018-06-26 21:59:36,071 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:59:36,072 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:59:36,072 INFO ]: Encoded RCFG 6 locations, 101 edges [2018-06-26 21:59:36,072 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:59:36 BasicIcfg [2018-06-26 21:59:36,072 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:59:36,074 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:59:36,074 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:59:36,077 INFO ]: TraceAbstraction initialized [2018-06-26 21:59:36,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:59:32" (1/4) ... [2018-06-26 21:59:36,078 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51115c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:59:36, skipping insertion in model container [2018-06-26 21:59:36,078 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:59:32" (2/4) ... [2018-06-26 21:59:36,078 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51115c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:59:36, skipping insertion in model container [2018-06-26 21:59:36,079 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:59:33" (3/4) ... [2018-06-26 21:59:36,079 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51115c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:59:36, skipping insertion in model container [2018-06-26 21:59:36,079 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:59:36" (4/4) ... [2018-06-26 21:59:36,080 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:59:36,089 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:59:36,096 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:59:36,132 INFO ]: Using default assertion order modulation [2018-06-26 21:59:36,132 INFO ]: Interprodecural is true [2018-06-26 21:59:36,132 INFO ]: Hoare is false [2018-06-26 21:59:36,133 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:59:36,133 INFO ]: Backedges is TWOTRACK [2018-06-26 21:59:36,133 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:59:36,133 INFO ]: Difference is false [2018-06-26 21:59:36,133 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:59:36,133 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:59:36,145 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:59:36,160 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:36,160 INFO ]: Found error trace [2018-06-26 21:59:36,161 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:36,162 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:36,167 INFO ]: Analyzing trace with hash 39101451, now seen corresponding path program 1 times [2018-06-26 21:59:36,169 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:36,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:36,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:36,205 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:36,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:36,252 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:36,352 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:36,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:36,355 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:36,357 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:36,374 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:36,374 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:36,377 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:59:37,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:37,226 INFO ]: Finished difference Result 7 states and 102 transitions. [2018-06-26 21:59:37,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:37,227 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:37,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:37,237 INFO ]: With dead ends: 7 [2018-06-26 21:59:37,238 INFO ]: Without dead ends: 7 [2018-06-26 21:59:37,239 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,257 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:59:37,274 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:59:37,276 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:37,277 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:37,278 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:37,279 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:37,279 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:37,279 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:37,279 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:37,279 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:37,279 INFO ]: Found error trace [2018-06-26 21:59:37,279 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:37,279 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:37,280 INFO ]: Analyzing trace with hash 39131242, now seen corresponding path program 1 times [2018-06-26 21:59:37,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:37,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:37,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:37,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:37,310 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:37,310 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:37,310 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:37,312 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:37,312 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:37,312 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,312 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:37,581 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:37,581 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:37,582 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:37,582 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:37,582 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:37,582 INFO ]: With dead ends: 9 [2018-06-26 21:59:37,582 INFO ]: Without dead ends: 9 [2018-06-26 21:59:37,583 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,583 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:37,587 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:37,587 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:37,587 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:37,587 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:37,588 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:37,588 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:37,588 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:37,588 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:37,588 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:37,588 INFO ]: Found error trace [2018-06-26 21:59:37,588 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:37,588 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:37,588 INFO ]: Analyzing trace with hash 39250406, now seen corresponding path program 1 times [2018-06-26 21:59:37,588 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:37,588 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:37,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,589 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:37,589 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,597 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:37,635 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:37,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:37,635 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:37,635 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:37,635 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:37,635 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,636 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:37,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:37,954 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:37,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:37,954 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:37,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:37,954 INFO ]: With dead ends: 9 [2018-06-26 21:59:37,954 INFO ]: Without dead ends: 9 [2018-06-26 21:59:37,955 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,955 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:37,958 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:37,958 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:37,959 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:37,959 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:37,959 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:37,959 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:37,959 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:37,959 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:37,959 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:37,959 INFO ]: Found error trace [2018-06-26 21:59:37,959 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:37,959 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:37,960 INFO ]: Analyzing trace with hash 39518525, now seen corresponding path program 1 times [2018-06-26 21:59:37,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:37,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:37,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:37,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:37,972 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:37,984 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:37,984 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:37,984 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:37,984 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:37,984 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:37,984 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:37,985 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:38,122 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:38,122 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:38,123 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:38,123 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:38,123 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:38,123 INFO ]: With dead ends: 9 [2018-06-26 21:59:38,123 INFO ]: Without dead ends: 9 [2018-06-26 21:59:38,123 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,124 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:38,127 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:38,127 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:38,127 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:38,127 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:38,128 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:38,128 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:38,128 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:38,128 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:38,128 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:38,128 INFO ]: Found error trace [2018-06-26 21:59:38,128 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:38,128 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:38,128 INFO ]: Analyzing trace with hash 40442046, now seen corresponding path program 1 times [2018-06-26 21:59:38,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:38,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:38,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:38,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,135 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:38,149 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:38,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:38,149 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:38,149 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:38,149 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:38,149 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,149 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:38,316 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:38,317 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:38,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:38,317 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:38,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:38,317 INFO ]: With dead ends: 9 [2018-06-26 21:59:38,317 INFO ]: Without dead ends: 9 [2018-06-26 21:59:38,317 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,317 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:38,320 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:38,320 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:38,320 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:38,321 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:38,321 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:38,321 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:38,321 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:38,321 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:38,321 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:38,321 INFO ]: Found error trace [2018-06-26 21:59:38,321 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:38,321 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:38,321 INFO ]: Analyzing trace with hash 38505631, now seen corresponding path program 1 times [2018-06-26 21:59:38,321 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:38,321 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:38,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,322 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:38,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,332 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:38,345 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:38,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:38,345 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:38,345 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:38,345 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:38,345 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,345 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:38,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:38,498 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:38,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:38,499 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:38,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:38,499 INFO ]: With dead ends: 9 [2018-06-26 21:59:38,499 INFO ]: Without dead ends: 9 [2018-06-26 21:59:38,499 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,500 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:38,502 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:38,502 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:38,503 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:38,503 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:38,503 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:38,503 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:38,503 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:38,503 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:38,503 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:59:38,503 INFO ]: Found error trace [2018-06-26 21:59:38,503 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:59:38,503 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:38,503 INFO ]: Analyzing trace with hash 38982287, now seen corresponding path program 1 times [2018-06-26 21:59:38,503 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:38,503 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:38,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:38,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,511 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:38,531 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:38,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:59:38,532 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:59:38,532 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:59:38,532 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:59:38,532 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,532 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 3 states. [2018-06-26 21:59:38,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:38,675 INFO ]: Finished difference Result 9 states and 104 transitions. [2018-06-26 21:59:38,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:59:38,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:59:38,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:38,676 INFO ]: With dead ends: 9 [2018-06-26 21:59:38,676 INFO ]: Without dead ends: 9 [2018-06-26 21:59:38,677 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:59:38,677 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:59:38,679 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-26 21:59:38,679 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:59:38,679 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-06-26 21:59:38,680 INFO ]: Start accepts. Automaton has 7 states and 102 transitions. Word has length 5 [2018-06-26 21:59:38,680 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:38,680 INFO ]: Abstraction has 7 states and 102 transitions. [2018-06-26 21:59:38,680 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:59:38,680 INFO ]: Start isEmpty. Operand 7 states and 102 transitions. [2018-06-26 21:59:38,680 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:59:38,680 INFO ]: Found error trace [2018-06-26 21:59:38,680 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:59:38,680 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:38,680 INFO ]: Analyzing trace with hash 1206342622, now seen corresponding path program 1 times [2018-06-26 21:59:38,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:38,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:38,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:38,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:38,930 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:39,190 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:39,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:39,191 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:39,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:39,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:39,352 INFO ]: Computing forward predicates... [2018-06-26 21:59:40,319 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:40,352 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:40,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:59:40,352 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:59:40,352 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:59:40,352 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:59:40,353 INFO ]: Start difference. First operand 7 states and 102 transitions. Second operand 5 states. [2018-06-26 21:59:41,223 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:41,223 INFO ]: Finished difference Result 11 states and 106 transitions. [2018-06-26 21:59:41,223 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:59:41,223 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:59:41,223 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:41,224 INFO ]: With dead ends: 11 [2018-06-26 21:59:41,224 INFO ]: Without dead ends: 11 [2018-06-26 21:59:41,224 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:59:41,224 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 21:59:41,226 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-06-26 21:59:41,226 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:59:41,226 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-06-26 21:59:41,227 INFO ]: Start accepts. Automaton has 8 states and 103 transitions. Word has length 6 [2018-06-26 21:59:41,227 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:41,227 INFO ]: Abstraction has 8 states and 103 transitions. [2018-06-26 21:59:41,227 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:59:41,227 INFO ]: Start isEmpty. Operand 8 states and 103 transitions. [2018-06-26 21:59:41,227 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:59:41,227 INFO ]: Found error trace [2018-06-26 21:59:41,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:59:41,227 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:41,227 INFO ]: Analyzing trace with hash 1208189664, now seen corresponding path program 1 times [2018-06-26 21:59:41,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:41,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:41,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:41,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:41,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:41,366 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:41,864 WARN ]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 21:59:41,864 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:41,864 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:41,864 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:41,880 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:42,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:42,056 INFO ]: Computing forward predicates... [2018-06-26 21:59:46,614 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:46,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:46,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 21:59:46,635 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:59:46,635 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:59:46,635 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:59:46,635 INFO ]: Start difference. First operand 8 states and 103 transitions. Second operand 5 states. [2018-06-26 21:59:46,824 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:46,824 INFO ]: Finished difference Result 16 states and 111 transitions. [2018-06-26 21:59:46,824 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:59:46,824 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 21:59:46,824 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:46,825 INFO ]: With dead ends: 16 [2018-06-26 21:59:46,825 INFO ]: Without dead ends: 16 [2018-06-26 21:59:46,825 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:59:46,825 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:59:46,827 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 8. [2018-06-26 21:59:46,827 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:59:46,827 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-06-26 21:59:46,827 INFO ]: Start accepts. Automaton has 8 states and 103 transitions. Word has length 6 [2018-06-26 21:59:46,827 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:46,827 INFO ]: Abstraction has 8 states and 103 transitions. [2018-06-26 21:59:46,827 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:59:46,828 INFO ]: Start isEmpty. Operand 8 states and 103 transitions. [2018-06-26 21:59:46,828 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:59:46,828 INFO ]: Found error trace [2018-06-26 21:59:46,828 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:59:46,829 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:46,829 INFO ]: Analyzing trace with hash 1225736563, now seen corresponding path program 1 times [2018-06-26 21:59:46,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:46,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:46,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:46,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:46,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:46,912 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:47,349 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 21:59:47,350 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:47,350 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:47,350 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:59:47,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:47,523 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:47,528 INFO ]: Computing forward predicates... [2018-06-26 21:59:47,928 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:47,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:47,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:59:47,951 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:59:47,951 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:59:47,951 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:59:47,951 INFO ]: Start difference. First operand 8 states and 103 transitions. Second operand 4 states. [2018-06-26 21:59:48,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:48,117 INFO ]: Finished difference Result 12 states and 107 transitions. [2018-06-26 21:59:48,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:59:48,117 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:59:48,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:48,118 INFO ]: With dead ends: 12 [2018-06-26 21:59:48,118 INFO ]: Without dead ends: 12 [2018-06-26 21:59:48,118 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:59:48,118 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:59:48,121 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-26 21:59:48,121 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:59:48,122 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-06-26 21:59:48,122 INFO ]: Start accepts. Automaton has 8 states and 103 transitions. Word has length 6 [2018-06-26 21:59:48,122 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:48,122 INFO ]: Abstraction has 8 states and 103 transitions. [2018-06-26 21:59:48,122 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:59:48,122 INFO ]: Start isEmpty. Operand 8 states and 103 transitions. [2018-06-26 21:59:48,122 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:59:48,122 INFO ]: Found error trace [2018-06-26 21:59:48,122 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:59:48,122 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:48,122 INFO ]: Analyzing trace with hash 1244206983, now seen corresponding path program 1 times [2018-06-26 21:59:48,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:48,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:48,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:48,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:48,123 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:48,179 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:48,377 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:48,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:48,377 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:48,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:48,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:48,522 INFO ]: Computing forward predicates... [2018-06-26 21:59:48,574 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:48,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:48,594 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:59:48,594 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:59:48,594 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:59:48,594 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:59:48,595 INFO ]: Start difference. First operand 8 states and 103 transitions. Second operand 4 states. [2018-06-26 21:59:48,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:48,811 INFO ]: Finished difference Result 12 states and 107 transitions. [2018-06-26 21:59:48,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:59:48,811 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:59:48,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:48,811 INFO ]: With dead ends: 12 [2018-06-26 21:59:48,811 INFO ]: Without dead ends: 12 [2018-06-26 21:59:48,812 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:59:48,812 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:59:48,813 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-26 21:59:48,813 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:59:48,813 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-06-26 21:59:48,813 INFO ]: Start accepts. Automaton has 8 states and 103 transitions. Word has length 6 [2018-06-26 21:59:48,813 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:48,813 INFO ]: Abstraction has 8 states and 103 transitions. [2018-06-26 21:59:48,813 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:59:48,813 INFO ]: Start isEmpty. Operand 8 states and 103 transitions. [2018-06-26 21:59:48,814 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:59:48,814 INFO ]: Found error trace [2018-06-26 21:59:48,814 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:59:48,814 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:48,814 INFO ]: Analyzing trace with hash 1263600924, now seen corresponding path program 1 times [2018-06-26 21:59:48,814 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:48,814 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:48,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:48,814 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:48,814 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:48,876 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:49,281 WARN ]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 21:59:49,282 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:49,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:49,282 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:59:49,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:49,439 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:49,442 INFO ]: Computing forward predicates... [2018-06-26 21:59:50,002 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:50,034 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:50,034 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:59:50,034 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:59:50,034 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:59:50,034 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:59:50,034 INFO ]: Start difference. First operand 8 states and 103 transitions. Second operand 4 states. [2018-06-26 21:59:50,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:50,243 INFO ]: Finished difference Result 12 states and 107 transitions. [2018-06-26 21:59:50,243 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:59:50,243 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 21:59:50,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:50,243 INFO ]: With dead ends: 12 [2018-06-26 21:59:50,243 INFO ]: Without dead ends: 12 [2018-06-26 21:59:50,244 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:59:50,244 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:59:50,245 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-06-26 21:59:50,245 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 21:59:50,246 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2018-06-26 21:59:50,246 INFO ]: Start accepts. Automaton has 8 states and 103 transitions. Word has length 6 [2018-06-26 21:59:50,246 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:50,246 INFO ]: Abstraction has 8 states and 103 transitions. [2018-06-26 21:59:50,246 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:59:50,246 INFO ]: Start isEmpty. Operand 8 states and 103 transitions. [2018-06-26 21:59:50,246 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:59:50,246 INFO ]: Found error trace [2018-06-26 21:59:50,246 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:59:50,246 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:50,246 INFO ]: Analyzing trace with hash -1263886741, now seen corresponding path program 2 times [2018-06-26 21:59:50,246 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:50,246 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:50,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:50,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:50,247 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:50,415 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:50,801 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:50,801 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:50,801 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:50,807 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:59:51,054 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:59:51,054 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:51,061 INFO ]: Computing forward predicates... [2018-06-26 21:59:51,304 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:59:51,309 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:59:51,312 WARN ]: expecting exponential blowup for input size 8 [2018-06-26 21:59:56,574 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:56,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:59:56,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 21:59:56,608 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:59:56,608 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:59:56,609 INFO ]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:59:56,609 INFO ]: Start difference. First operand 8 states and 103 transitions. Second operand 6 states. [2018-06-26 21:59:56,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:59:56,950 INFO ]: Finished difference Result 12 states and 107 transitions. [2018-06-26 21:59:56,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:59:56,951 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 21:59:56,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:59:56,951 INFO ]: With dead ends: 12 [2018-06-26 21:59:56,951 INFO ]: Without dead ends: 12 [2018-06-26 21:59:56,951 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:59:56,951 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 21:59:56,952 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-06-26 21:59:56,952 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:59:56,953 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2018-06-26 21:59:56,953 INFO ]: Start accepts. Automaton has 9 states and 104 transitions. Word has length 7 [2018-06-26 21:59:56,953 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:59:56,953 INFO ]: Abstraction has 9 states and 104 transitions. [2018-06-26 21:59:56,953 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:59:56,953 INFO ]: Start isEmpty. Operand 9 states and 104 transitions. [2018-06-26 21:59:56,953 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 21:59:56,953 INFO ]: Found error trace [2018-06-26 21:59:56,953 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 21:59:56,953 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:59:56,953 INFO ]: Analyzing trace with hash -1235257590, now seen corresponding path program 1 times [2018-06-26 21:59:56,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:59:56,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:59:56,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:56,954 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:59:56,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:59:57,123 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:57,570 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-26 21:59:57,582 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:59:57,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:59:57,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:59:57,588 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:59:57,855 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:59:57,862 INFO ]: Computing forward predicates... [2018-06-26 21:59:59,534 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 21:59:59,535 WARN ]: expecting exponential blowup for input size 7 [2018-06-26 21:59:59,537 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:00:07,767 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:07,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:07,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:00:07,788 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:00:07,788 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:00:07,788 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:07,788 INFO ]: Start difference. First operand 9 states and 104 transitions. Second operand 6 states. [2018-06-26 22:00:07,997 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:07,997 INFO ]: Finished difference Result 19 states and 114 transitions. [2018-06-26 22:00:07,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:00:07,999 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 22:00:07,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:07,999 INFO ]: With dead ends: 19 [2018-06-26 22:00:07,999 INFO ]: Without dead ends: 19 [2018-06-26 22:00:07,999 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:00:07,999 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 22:00:08,001 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 9. [2018-06-26 22:00:08,001 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:08,001 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2018-06-26 22:00:08,001 INFO ]: Start accepts. Automaton has 9 states and 104 transitions. Word has length 7 [2018-06-26 22:00:08,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:08,001 INFO ]: Abstraction has 9 states and 104 transitions. [2018-06-26 22:00:08,001 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:00:08,001 INFO ]: Start isEmpty. Operand 9 states and 104 transitions. [2018-06-26 22:00:08,001 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:00:08,001 INFO ]: Found error trace [2018-06-26 22:00:08,002 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 22:00:08,002 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:08,002 INFO ]: Analyzing trace with hash -1206628439, now seen corresponding path program 2 times [2018-06-26 22:00:08,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:08,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:08,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:08,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:08,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:08,096 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:08,392 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:08,392 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:08,392 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:08,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 22:00:08,619 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 22:00:08,619 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:08,626 INFO ]: Computing forward predicates... [2018-06-26 22:00:09,585 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:09,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 22:00:09,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 22:00:09,606 INFO ]: Interpolant automaton has 6 states [2018-06-26 22:00:09,606 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 22:00:09,606 INFO ]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-26 22:00:09,606 INFO ]: Start difference. First operand 9 states and 104 transitions. Second operand 6 states. [2018-06-26 22:00:09,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 22:00:09,837 INFO ]: Finished difference Result 19 states and 114 transitions. [2018-06-26 22:00:09,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 22:00:09,838 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 22:00:09,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 22:00:09,838 INFO ]: With dead ends: 19 [2018-06-26 22:00:09,838 INFO ]: Without dead ends: 19 [2018-06-26 22:00:09,838 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-06-26 22:00:09,839 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 22:00:09,840 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 9. [2018-06-26 22:00:09,840 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 22:00:09,840 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2018-06-26 22:00:09,841 INFO ]: Start accepts. Automaton has 9 states and 104 transitions. Word has length 7 [2018-06-26 22:00:09,841 INFO ]: Finished accepts. word is rejected. [2018-06-26 22:00:09,841 INFO ]: Abstraction has 9 states and 104 transitions. [2018-06-26 22:00:09,841 INFO ]: Interpolant automaton has 6 states. [2018-06-26 22:00:09,841 INFO ]: Start isEmpty. Operand 9 states and 104 transitions. [2018-06-26 22:00:09,841 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 22:00:09,841 INFO ]: Found error trace [2018-06-26 22:00:09,841 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 22:00:09,841 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 22:00:09,841 INFO ]: Analyzing trace with hash -1063482684, now seen corresponding path program 1 times [2018-06-26 22:00:09,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 22:00:09,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 22:00:09,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:09,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 22:00:09,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 22:00:09,911 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:10,232 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 22:00:10,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 22:00:10,232 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:10,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 22:00:10,451 INFO ]: Conjunction of SSA is unsat [2018-06-26 22:00:10,458 INFO ]: Computing forward predicates... [2018-06-26 22:00:10,941 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:00:10,947 WARN ]: expecting exponential blowup for input size 6 [2018-06-26 22:00:10,950 WARN ]: expecting exponential blowup for input size 7 Received shutdown request... [2018-06-26 22:00:34,991 INFO ]: Timeout while computing interpolants [2018-06-26 22:00:35,191 WARN ]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 22:00:35,191 WARN ]: Verification canceled [2018-06-26 22:00:35,193 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 22:00:35,194 WARN ]: Timeout [2018-06-26 22:00:35,194 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 10:00:35 BasicIcfg [2018-06-26 22:00:35,194 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 22:00:35,195 INFO ]: Toolchain (without parser) took 62480.10 ms. Allocated memory was 334.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 230.4 MB in the beginning and 680.7 MB in the end (delta: -450.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,196 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 22:00:35,196 INFO ]: ChcToBoogie took 81.87 ms. Allocated memory is still 334.0 MB. Free memory was 230.4 MB in the beginning and 227.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,197 INFO ]: Boogie Preprocessor took 117.22 ms. Allocated memory is still 334.0 MB. Free memory was 227.1 MB in the beginning and 220.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,197 INFO ]: RCFGBuilder took 776.20 ms. Allocated memory was 334.0 MB in the beginning and 387.4 MB in the end (delta: 53.5 MB). Free memory was 220.5 MB in the beginning and 295.7 MB in the end (delta: -75.2 MB). Peak memory consumption was 50.8 MB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,197 INFO ]: BlockEncodingV2 took 2374.40 ms. Allocated memory was 387.4 MB in the beginning and 574.1 MB in the end (delta: 186.6 MB). Free memory was 295.7 MB in the beginning and 411.3 MB in the end (delta: -115.6 MB). Peak memory consumption was 181.8 MB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,198 INFO ]: TraceAbstraction took 59120.57 ms. Allocated memory was 574.1 MB in the beginning and 1.5 GB in the end (delta: 917.0 MB). Free memory was 411.3 MB in the beginning and 680.7 MB in the end (delta: -269.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-26 22:00:35,205 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 101 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.6 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 81.87 ms. Allocated memory is still 334.0 MB. Free memory was 230.4 MB in the beginning and 227.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 117.22 ms. Allocated memory is still 334.0 MB. Free memory was 227.1 MB in the beginning and 220.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 3.6 GB. * RCFGBuilder took 776.20 ms. Allocated memory was 334.0 MB in the beginning and 387.4 MB in the end (delta: 53.5 MB). Free memory was 220.5 MB in the beginning and 295.7 MB in the end (delta: -75.2 MB). Peak memory consumption was 50.8 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2374.40 ms. Allocated memory was 387.4 MB in the beginning and 574.1 MB in the end (delta: 186.6 MB). Free memory was 295.7 MB in the beginning and 411.3 MB in the end (delta: -115.6 MB). Peak memory consumption was 181.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59120.57 ms. Allocated memory was 574.1 MB in the beginning and 1.5 GB in the end (delta: 917.0 MB). Free memory was 411.3 MB in the beginning and 680.7 MB in the end (delta: -269.4 MB). Peak memory consumption was 1.2 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 BasicCegarLoop was analyzing trace of length 8 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 37 quantified variables from 11 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 59.0s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1503 SDtfs, 0 SDslu, 87 SDs, 0 SdLazy, 1233 SolverSat, 1408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 58 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874 SizeOfPredicates, 72 NumberOfNonLiveVariables, 6573 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 0/28 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/svd.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_22-00-35-219.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_22-00-35-219.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_22-00-35-219.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/svd.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_22-00-35-219.csv Completed graceful shutdown