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/lustre/hysteresis_3.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 04:56:04,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 04:56:04,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 04:56:04,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 04:56:04,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 04:56:04,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 04:56:04,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 04:56:04,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 04:56:04,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 04:56:04,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 04:56:04,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 04:56:04,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 04:56:04,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 04:56:04,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 04:56:04,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 04:56:04,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 04:56:04,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 04:56:04,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 04:56:04,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 04:56:04,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 04:56:04,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 04:56:04,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 04:56:04,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 04:56:04,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 04:56:04,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 04:56:04,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 04:56:04,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 04:56:04,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 04:56:04,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 04:56:04,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 04:56:04,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 04:56:04,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 04:56:04,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 04:56:04,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 04:56:04,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 04:56:04,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 04:56:04,502 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 04:56:04,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 04:56:04,503 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 04:56:04,503 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 04:56:04,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 04:56:04,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 04:56:04,504 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 04:56:04,505 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 04:56:04,505 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 04:56:04,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 04:56:04,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 04:56:04,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 04:56:04,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 04:56:04,506 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 04:56:04,506 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 04:56:04,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 04:56:04,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 04:56:04,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 04:56:04,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 04:56:04,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 04:56:04,507 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 04:56:04,509 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 04:56:04,509 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 04:56:04,571 INFO ]: Repository-Root is: /tmp [2018-06-25 04:56:04,582 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 04:56:04,592 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 04:56:04,594 INFO ]: Initializing SmtParser... [2018-06-25 04:56:04,594 INFO ]: SmtParser initialized [2018-06-25 04:56:04,595 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_3.smt2 [2018-06-25 04:56:04,596 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-25 04:56:04,686 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_3.smt2 unknown [2018-06-25 04:56:04,994 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/hysteresis_3.smt2 [2018-06-25 04:56:04,999 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 04:56:05,015 INFO ]: Walking toolchain with 5 elements. [2018-06-25 04:56:05,015 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 04:56:05,015 INFO ]: Initializing ChcToBoogie... [2018-06-25 04:56:05,016 INFO ]: ChcToBoogie initialized [2018-06-25 04:56:05,024 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 04:56:04" (1/1) ... [2018-06-25 04:56:05,095 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05 Unit [2018-06-25 04:56:05,095 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 04:56:05,096 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 04:56:05,096 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 04:56:05,096 INFO ]: Boogie Preprocessor initialized [2018-06-25 04:56:05,118 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,118 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,126 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,126 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,140 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,141 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,143 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,145 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 04:56:05,145 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 04:56:05,145 INFO ]: Initializing RCFGBuilder... [2018-06-25 04:56:05,145 INFO ]: RCFGBuilder initialized [2018-06-25 04:56:05,146 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (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-25 04:56:05,166 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 04:56:05,167 INFO ]: Found specification of procedure gotoProc [2018-06-25 04:56:05,167 INFO ]: Found implementation of procedure gotoProc [2018-06-25 04:56:05,167 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 04:56:05,167 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 04:56:05,167 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-25 04:56:05,438 INFO ]: Using library mode [2018-06-25 04:56:05,439 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:56:05 BoogieIcfgContainer [2018-06-25 04:56:05,439 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 04:56:05,448 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 04:56:05,448 INFO ]: Initializing BlockEncodingV2... [2018-06-25 04:56:05,449 INFO ]: BlockEncodingV2 initialized [2018-06-25 04:56:05,450 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:56:05" (1/1) ... [2018-06-25 04:56:05,473 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 04:56:05,475 INFO ]: Using Remove infeasible edges [2018-06-25 04:56:05,476 INFO ]: Using Maximize final states [2018-06-25 04:56:05,476 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 04:56:05,476 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 04:56:05,478 INFO ]: Using Remove sink states [2018-06-25 04:56:05,479 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 04:56:05,479 INFO ]: Using Use SBE [2018-06-25 04:56:05,486 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 04:56:07,951 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 04:56:08,153 WARN ]: Simplifying disjunction of 10752 conjuctions. This might take some time... [2018-06-25 04:56:29,937 INFO ]: Simplified to disjunction of 10752 conjuctions. [2018-06-25 04:56:30,053 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 04:56:30,296 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 04:56:30,300 INFO ]: SBE split 2 edges [2018-06-25 04:56:30,333 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 04:56:30,338 INFO ]: 0 new accepting states [2018-06-25 04:56:42,478 INFO ]: Removed 2101 edges and 2 locations by large block encoding [2018-06-25 04:56:42,480 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:56:42,509 INFO ]: Removed 44 edges and 0 locations because of local infeasibility [2018-06-25 04:56:42,510 INFO ]: 0 new accepting states [2018-06-25 04:56:42,512 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 04:56:42,514 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:56:42,519 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 04:56:42,521 INFO ]: 0 new accepting states [2018-06-25 04:56:42,523 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 04:56:42,524 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 04:56:42,536 INFO ]: Encoded RCFG 6 locations, 2059 edges [2018-06-25 04:56:42,536 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 04:56:42 BasicIcfg [2018-06-25 04:56:42,537 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 04:56:42,539 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 04:56:42,539 INFO ]: Initializing TraceAbstraction... [2018-06-25 04:56:42,543 INFO ]: TraceAbstraction initialized [2018-06-25 04:56:42,543 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 04:56:04" (1/4) ... [2018-06-25 04:56:42,544 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7ef8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 04:56:42, skipping insertion in model container [2018-06-25 04:56:42,544 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 04:56:05" (2/4) ... [2018-06-25 04:56:42,544 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7ef8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 04:56:42, skipping insertion in model container [2018-06-25 04:56:42,544 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 04:56:05" (3/4) ... [2018-06-25 04:56:42,545 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7ef8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 04:56:42, skipping insertion in model container [2018-06-25 04:56:42,545 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 04:56:42" (4/4) ... [2018-06-25 04:56:42,548 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 04:56:42,558 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 04:56:42,568 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 04:56:42,617 INFO ]: Using default assertion order modulation [2018-06-25 04:56:42,618 INFO ]: Interprodecural is true [2018-06-25 04:56:42,618 INFO ]: Hoare is false [2018-06-25 04:56:42,618 INFO ]: Compute interpolants for FPandBP [2018-06-25 04:56:42,618 INFO ]: Backedges is TWOTRACK [2018-06-25 04:56:42,618 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 04:56:42,618 INFO ]: Difference is false [2018-06-25 04:56:42,618 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 04:56:42,618 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 04:56:42,640 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 04:56:42,660 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 04:56:42,660 INFO ]: Found error trace [2018-06-25 04:56:42,661 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 04:56:42,661 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:42,667 INFO ]: Analyzing trace with hash 161133075, now seen corresponding path program 1 times [2018-06-25 04:56:42,669 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:42,669 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:42,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:42,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:42,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:42,752 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:42,855 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:42,858 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:42,858 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:42,860 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:42,876 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:42,876 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:42,879 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 04:56:46,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:46,491 INFO ]: Finished difference Result 7 states and 2060 transitions. [2018-06-25 04:56:46,492 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:46,493 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 04:56:46,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:46,508 INFO ]: With dead ends: 7 [2018-06-25 04:56:46,508 INFO ]: Without dead ends: 7 [2018-06-25 04:56:46,511 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-25 04:56:46,529 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:46,573 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:46,575 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:46,579 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2060 transitions. [2018-06-25 04:56:46,580 INFO ]: Start accepts. Automaton has 7 states and 2060 transitions. Word has length 5 [2018-06-25 04:56:46,581 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:46,581 INFO ]: Abstraction has 7 states and 2060 transitions. [2018-06-25 04:56:46,581 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:46,581 INFO ]: Start isEmpty. Operand 7 states and 2060 transitions. [2018-06-25 04:56:46,582 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:46,582 INFO ]: Found error trace [2018-06-25 04:56:46,582 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:46,582 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:46,583 INFO ]: Analyzing trace with hash 579757381, now seen corresponding path program 1 times [2018-06-25 04:56:46,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:46,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:46,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:46,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:46,584 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:46,620 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:46,716 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:46,717 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:46,717 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:46,718 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:46,718 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:46,719 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:46,719 INFO ]: Start difference. First operand 7 states and 2060 transitions. Second operand 3 states. [2018-06-25 04:56:49,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:49,619 INFO ]: Finished difference Result 8 states and 2060 transitions. [2018-06-25 04:56:49,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:49,619 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:49,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:49,621 INFO ]: With dead ends: 8 [2018-06-25 04:56:49,621 INFO ]: Without dead ends: 7 [2018-06-25 04:56:49,622 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-25 04:56:49,622 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:49,633 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:49,634 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:49,637 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1548 transitions. [2018-06-25 04:56:49,638 INFO ]: Start accepts. Automaton has 7 states and 1548 transitions. Word has length 6 [2018-06-25 04:56:49,638 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:49,638 INFO ]: Abstraction has 7 states and 1548 transitions. [2018-06-25 04:56:49,638 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:49,638 INFO ]: Start isEmpty. Operand 7 states and 1548 transitions. [2018-06-25 04:56:49,639 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:49,639 INFO ]: Found error trace [2018-06-25 04:56:49,639 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:49,639 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:49,639 INFO ]: Analyzing trace with hash 580680902, now seen corresponding path program 1 times [2018-06-25 04:56:49,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:49,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:49,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:49,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:49,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:49,698 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:49,744 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:49,744 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:49,744 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:49,744 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:49,744 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:49,744 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:49,745 INFO ]: Start difference. First operand 7 states and 1548 transitions. Second operand 3 states. [2018-06-25 04:56:51,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:51,819 INFO ]: Finished difference Result 8 states and 1548 transitions. [2018-06-25 04:56:51,820 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:51,820 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:51,820 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:51,821 INFO ]: With dead ends: 8 [2018-06-25 04:56:51,821 INFO ]: Without dead ends: 7 [2018-06-25 04:56:51,821 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-25 04:56:51,821 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:51,825 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:51,825 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:51,826 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 524 transitions. [2018-06-25 04:56:51,826 INFO ]: Start accepts. Automaton has 7 states and 524 transitions. Word has length 6 [2018-06-25 04:56:51,826 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:51,826 INFO ]: Abstraction has 7 states and 524 transitions. [2018-06-25 04:56:51,826 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:51,826 INFO ]: Start isEmpty. Operand 7 states and 524 transitions. [2018-06-25 04:56:51,827 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:51,827 INFO ]: Found error trace [2018-06-25 04:56:51,827 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:51,827 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:51,827 INFO ]: Analyzing trace with hash 581604423, now seen corresponding path program 1 times [2018-06-25 04:56:51,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:51,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:51,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:51,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:51,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:51,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:51,883 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:51,883 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:51,884 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:51,884 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:51,884 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:51,884 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:51,884 INFO ]: Start difference. First operand 7 states and 524 transitions. Second operand 3 states. [2018-06-25 04:56:52,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:52,430 INFO ]: Finished difference Result 8 states and 524 transitions. [2018-06-25 04:56:52,430 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:52,431 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:52,431 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:52,431 INFO ]: With dead ends: 8 [2018-06-25 04:56:52,431 INFO ]: Without dead ends: 7 [2018-06-25 04:56:52,432 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-25 04:56:52,432 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:52,435 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:52,435 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:52,436 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 396 transitions. [2018-06-25 04:56:52,436 INFO ]: Start accepts. Automaton has 7 states and 396 transitions. Word has length 6 [2018-06-25 04:56:52,436 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:52,436 INFO ]: Abstraction has 7 states and 396 transitions. [2018-06-25 04:56:52,436 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:52,436 INFO ]: Start isEmpty. Operand 7 states and 396 transitions. [2018-06-25 04:56:52,436 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:52,436 INFO ]: Found error trace [2018-06-25 04:56:52,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:52,436 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:52,436 INFO ]: Analyzing trace with hash 107838150, now seen corresponding path program 1 times [2018-06-25 04:56:52,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:52,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:52,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:52,438 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:52,438 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:52,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:52,499 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:52,500 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:52,500 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:52,500 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:52,500 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:52,500 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:52,500 INFO ]: Start difference. First operand 7 states and 396 transitions. Second operand 3 states. [2018-06-25 04:56:52,887 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:52,888 INFO ]: Finished difference Result 8 states and 396 transitions. [2018-06-25 04:56:52,888 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:52,889 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:52,889 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:52,889 INFO ]: With dead ends: 8 [2018-06-25 04:56:52,889 INFO ]: Without dead ends: 7 [2018-06-25 04:56:52,889 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-25 04:56:52,890 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:52,891 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:52,891 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:52,891 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2018-06-25 04:56:52,891 INFO ]: Start accepts. Automaton has 7 states and 204 transitions. Word has length 6 [2018-06-25 04:56:52,891 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:52,891 INFO ]: Abstraction has 7 states and 204 transitions. [2018-06-25 04:56:52,891 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:52,892 INFO ]: Start isEmpty. Operand 7 states and 204 transitions. [2018-06-25 04:56:52,892 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:52,892 INFO ]: Found error trace [2018-06-25 04:56:52,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:52,892 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:52,892 INFO ]: Analyzing trace with hash 582527944, now seen corresponding path program 1 times [2018-06-25 04:56:52,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:52,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:52,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:52,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:52,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:52,919 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:53,030 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:53,030 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:53,030 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:53,030 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:53,030 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:53,030 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:53,030 INFO ]: Start difference. First operand 7 states and 204 transitions. Second operand 3 states. [2018-06-25 04:56:53,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:53,225 INFO ]: Finished difference Result 8 states and 204 transitions. [2018-06-25 04:56:53,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:53,226 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:53,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:53,226 INFO ]: With dead ends: 8 [2018-06-25 04:56:53,226 INFO ]: Without dead ends: 7 [2018-06-25 04:56:53,226 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-25 04:56:53,227 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:53,228 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:53,228 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:53,229 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2018-06-25 04:56:53,229 INFO ]: Start accepts. Automaton has 7 states and 156 transitions. Word has length 6 [2018-06-25 04:56:53,229 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:53,229 INFO ]: Abstraction has 7 states and 156 transitions. [2018-06-25 04:56:53,229 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:53,229 INFO ]: Start isEmpty. Operand 7 states and 156 transitions. [2018-06-25 04:56:53,229 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:53,229 INFO ]: Found error trace [2018-06-25 04:56:53,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:53,229 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:53,230 INFO ]: Analyzing trace with hash -363157560, now seen corresponding path program 1 times [2018-06-25 04:56:53,230 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:53,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:53,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:53,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:53,231 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:53,248 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:53,358 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:53,358 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:53,358 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:53,358 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:53,358 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:53,358 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:53,358 INFO ]: Start difference. First operand 7 states and 156 transitions. Second operand 3 states. [2018-06-25 04:56:53,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:53,720 INFO ]: Finished difference Result 8 states and 156 transitions. [2018-06-25 04:56:53,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:53,721 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:53,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:53,721 INFO ]: With dead ends: 8 [2018-06-25 04:56:53,721 INFO ]: Without dead ends: 7 [2018-06-25 04:56:53,721 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-25 04:56:53,721 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:53,722 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:53,722 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:53,723 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-06-25 04:56:53,723 INFO ]: Start accepts. Automaton has 7 states and 84 transitions. Word has length 6 [2018-06-25 04:56:53,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:53,723 INFO ]: Abstraction has 7 states and 84 transitions. [2018-06-25 04:56:53,723 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:53,723 INFO ]: Start isEmpty. Operand 7 states and 84 transitions. [2018-06-25 04:56:53,723 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:53,723 INFO ]: Found error trace [2018-06-25 04:56:53,723 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:53,723 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:53,723 INFO ]: Analyzing trace with hash -720560187, now seen corresponding path program 1 times [2018-06-25 04:56:53,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:53,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:53,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:53,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:53,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:53,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:53,844 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:53,844 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:53,844 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:53,844 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:53,844 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:53,844 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:53,844 INFO ]: Start difference. First operand 7 states and 84 transitions. Second operand 3 states. [2018-06-25 04:56:54,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:54,053 INFO ]: Finished difference Result 8 states and 84 transitions. [2018-06-25 04:56:54,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:54,053 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:54,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:54,053 INFO ]: With dead ends: 8 [2018-06-25 04:56:54,053 INFO ]: Without dead ends: 7 [2018-06-25 04:56:54,054 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-25 04:56:54,054 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:54,054 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:54,054 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:54,055 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2018-06-25 04:56:54,055 INFO ]: Start accepts. Automaton has 7 states and 60 transitions. Word has length 6 [2018-06-25 04:56:54,055 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:54,055 INFO ]: Abstraction has 7 states and 60 transitions. [2018-06-25 04:56:54,055 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:54,055 INFO ]: Start isEmpty. Operand 7 states and 60 transitions. [2018-06-25 04:56:54,055 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:54,055 INFO ]: Found error trace [2018-06-25 04:56:54,055 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:54,055 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:54,055 INFO ]: Analyzing trace with hash -1252508283, now seen corresponding path program 1 times [2018-06-25 04:56:54,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:54,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:54,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:54,056 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:54,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:54,072 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:54,200 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:54,200 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:54,200 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:54,200 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:54,200 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:54,200 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:54,201 INFO ]: Start difference. First operand 7 states and 60 transitions. Second operand 3 states. [2018-06-25 04:56:54,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:54,297 INFO ]: Finished difference Result 8 states and 60 transitions. [2018-06-25 04:56:54,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:54,302 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 04:56:54,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:54,302 INFO ]: With dead ends: 8 [2018-06-25 04:56:54,302 INFO ]: Without dead ends: 7 [2018-06-25 04:56:54,302 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:54,302 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 04:56:54,303 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 04:56:54,303 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 04:56:54,303 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-06-25 04:56:54,304 INFO ]: Start accepts. Automaton has 7 states and 36 transitions. Word has length 6 [2018-06-25 04:56:54,304 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:54,304 INFO ]: Abstraction has 7 states and 36 transitions. [2018-06-25 04:56:54,304 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:54,304 INFO ]: Start isEmpty. Operand 7 states and 36 transitions. [2018-06-25 04:56:54,304 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 04:56:54,304 INFO ]: Found error trace [2018-06-25 04:56:54,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 04:56:54,304 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:54,304 INFO ]: Analyzing trace with hash 404288391, now seen corresponding path program 1 times [2018-06-25 04:56:54,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:54,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:54,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:54,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:54,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:54,315 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:54,380 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:54,380 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:56:54,380 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-25 04:56:54,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:54,456 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:54,465 INFO ]: Computing forward predicates... [2018-06-25 04:56:54,520 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:54,557 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:56:54,557 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 04:56:54,557 INFO ]: Interpolant automaton has 4 states [2018-06-25 04:56:54,558 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 04:56:54,558 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 04:56:54,558 INFO ]: Start difference. First operand 7 states and 36 transitions. Second operand 4 states. [2018-06-25 04:56:55,525 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:55,525 INFO ]: Finished difference Result 9 states and 37 transitions. [2018-06-25 04:56:55,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:56:55,525 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 04:56:55,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:55,525 INFO ]: With dead ends: 9 [2018-06-25 04:56:55,526 INFO ]: Without dead ends: 8 [2018-06-25 04:56:55,526 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 04:56:55,526 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:55,527 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:55,527 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:55,527 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 04:56:55,528 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 04:56:55,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:55,528 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 04:56:55,528 INFO ]: Interpolant automaton has 4 states. [2018-06-25 04:56:55,528 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 04:56:55,528 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:55,528 INFO ]: Found error trace [2018-06-25 04:56:55,528 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:55,528 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:55,528 INFO ]: Analyzing trace with hash -180124445, now seen corresponding path program 1 times [2018-06-25 04:56:55,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:55,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:55,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:55,529 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:55,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:55,558 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:55,688 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:56:55,688 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:55,688 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:55,688 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:55,688 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:55,688 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:55,689 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 3 states. [2018-06-25 04:56:55,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:55,858 INFO ]: Finished difference Result 9 states and 25 transitions. [2018-06-25 04:56:55,858 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:55,858 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:56:55,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:55,859 INFO ]: With dead ends: 9 [2018-06-25 04:56:55,859 INFO ]: Without dead ends: 8 [2018-06-25 04:56:55,859 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:55,859 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:55,860 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:55,860 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:55,860 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-06-25 04:56:55,860 INFO ]: Start accepts. Automaton has 8 states and 21 transitions. Word has length 7 [2018-06-25 04:56:55,860 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:55,860 INFO ]: Abstraction has 8 states and 21 transitions. [2018-06-25 04:56:55,860 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:55,860 INFO ]: Start isEmpty. Operand 8 states and 21 transitions. [2018-06-25 04:56:55,861 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:55,861 INFO ]: Found error trace [2018-06-25 04:56:55,861 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:55,861 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:55,861 INFO ]: Analyzing trace with hash 1910398224, now seen corresponding path program 1 times [2018-06-25 04:56:55,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:55,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:55,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:55,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:55,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:55,874 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:55,987 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 04:56:55,987 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 04:56:55,987 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 04:56:55,987 INFO ]: Interpolant automaton has 3 states [2018-06-25 04:56:55,987 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 04:56:55,987 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 04:56:55,987 INFO ]: Start difference. First operand 8 states and 21 transitions. Second operand 3 states. [2018-06-25 04:56:56,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:56,178 INFO ]: Finished difference Result 9 states and 21 transitions. [2018-06-25 04:56:56,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 04:56:56,178 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 04:56:56,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:56,178 INFO ]: With dead ends: 9 [2018-06-25 04:56:56,178 INFO ]: Without dead ends: 8 [2018-06-25 04:56:56,179 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-25 04:56:56,179 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:56,179 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:56,180 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:56,180 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-06-25 04:56:56,180 INFO ]: Start accepts. Automaton has 8 states and 17 transitions. Word has length 7 [2018-06-25 04:56:56,180 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:56,180 INFO ]: Abstraction has 8 states and 17 transitions. [2018-06-25 04:56:56,180 INFO ]: Interpolant automaton has 3 states. [2018-06-25 04:56:56,180 INFO ]: Start isEmpty. Operand 8 states and 17 transitions. [2018-06-25 04:56:56,180 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:56,180 INFO ]: Found error trace [2018-06-25 04:56:56,180 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:56,180 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:56,180 INFO ]: Analyzing trace with hash -2045181782, now seen corresponding path program 1 times [2018-06-25 04:56:56,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:56,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:56,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:56,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:56,181 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:56,205 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:56,930 WARN ]: Spent 635.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-06-25 04:56:57,423 WARN ]: Spent 439.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-25 04:56:57,566 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:57,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:56:57,566 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) [2018-06-25 04:56:57,581 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:56:57,645 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:57,648 INFO ]: Computing forward predicates... [2018-06-25 04:56:57,865 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 04:56:58,542 WARN ]: Spent 261.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-06-25 04:56:58,709 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:58,731 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:56:58,731 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:56:58,731 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:56:58,731 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:56:58,731 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:56:58,731 INFO ]: Start difference. First operand 8 states and 17 transitions. Second operand 8 states. [2018-06-25 04:56:58,841 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:56:58,841 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 04:56:58,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:56:58,844 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:56:58,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:56:58,844 INFO ]: With dead ends: 10 [2018-06-25 04:56:58,844 INFO ]: Without dead ends: 8 [2018-06-25 04:56:58,845 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 04:56:58,845 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:56:58,846 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:56:58,846 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:56:58,846 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-06-25 04:56:58,846 INFO ]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 7 [2018-06-25 04:56:58,846 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:56:58,846 INFO ]: Abstraction has 8 states and 16 transitions. [2018-06-25 04:56:58,846 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:56:58,846 INFO ]: Start isEmpty. Operand 8 states and 16 transitions. [2018-06-25 04:56:58,846 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:56:58,846 INFO ]: Found error trace [2018-06-25 04:56:58,846 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:56:58,846 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:56:58,847 INFO ]: Analyzing trace with hash -1900252089, now seen corresponding path program 1 times [2018-06-25 04:56:58,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:56:58,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:56:58,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:58,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:58,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:56:58,873 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:59,470 WARN ]: Spent 536.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 15 [2018-06-25 04:56:59,576 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:59,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:56:59,576 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:56:59,584 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:56:59,627 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:56:59,629 INFO ]: Computing forward predicates... [2018-06-25 04:56:59,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:56:59,744 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:56:59,744 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:56:59,744 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:56:59,745 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:56:59,745 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:56:59,745 INFO ]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2018-06-25 04:57:00,098 WARN ]: Spent 245.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-06-25 04:57:00,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:57:00,149 INFO ]: Finished difference Result 10 states and 17 transitions. [2018-06-25 04:57:00,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:57:00,149 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:57:00,149 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:57:00,149 INFO ]: With dead ends: 10 [2018-06-25 04:57:00,149 INFO ]: Without dead ends: 8 [2018-06-25 04:57:00,149 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 04:57:00,149 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:57:00,150 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:57:00,150 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:57:00,151 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-25 04:57:00,151 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 7 [2018-06-25 04:57:00,151 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:57:00,151 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-25 04:57:00,151 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:57:00,151 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-25 04:57:00,151 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:57:00,151 INFO ]: Found error trace [2018-06-25 04:57:00,151 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:57:00,151 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:57:00,151 INFO ]: Analyzing trace with hash -1383143433, now seen corresponding path program 1 times [2018-06-25 04:57:00,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:57:00,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:57:00,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:57:00,152 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:57:00,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:57:00,168 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:57:00,438 WARN ]: Spent 190.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 7 [2018-06-25 04:57:00,492 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:57:00,492 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:57:00,492 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-25 04:57:00,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:57:00,535 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:57:00,538 INFO ]: Computing forward predicates... [2018-06-25 04:57:00,731 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-06-25 04:57:00,846 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:57:00,867 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:57:00,867 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:57:00,867 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:57:00,867 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:57:00,867 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:57:00,868 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 8 states. [2018-06-25 04:57:00,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:57:00,925 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 04:57:00,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 04:57:00,926 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:57:00,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:57:00,926 INFO ]: With dead ends: 10 [2018-06-25 04:57:00,926 INFO ]: Without dead ends: 8 [2018-06-25 04:57:00,927 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 04:57:00,927 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 04:57:00,927 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 04:57:00,927 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 04:57:00,928 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-25 04:57:00,928 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 7 [2018-06-25 04:57:00,928 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:57:00,928 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-25 04:57:00,928 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:57:00,928 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-25 04:57:00,928 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 04:57:00,928 INFO ]: Found error trace [2018-06-25 04:57:00,928 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 04:57:00,928 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 04:57:00,928 INFO ]: Analyzing trace with hash -1528667772, now seen corresponding path program 1 times [2018-06-25 04:57:00,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 04:57:00,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 04:57:00,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:57:00,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:57:00,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 04:57:00,943 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:57:01,620 WARN ]: Spent 624.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-06-25 04:57:02,074 WARN ]: Spent 407.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-25 04:57:02,206 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:57:02,206 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 04:57:02,206 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 04:57:02,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 04:57:02,276 INFO ]: Conjunction of SSA is unsat [2018-06-25 04:57:02,279 INFO ]: Computing forward predicates... [2018-06-25 04:57:02,504 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 04:57:03,188 WARN ]: Spent 226.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-06-25 04:57:03,212 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 04:57:03,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 04:57:03,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 04:57:03,233 INFO ]: Interpolant automaton has 8 states [2018-06-25 04:57:03,233 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 04:57:03,237 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 04:57:03,237 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 8 states. [2018-06-25 04:57:03,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 04:57:03,321 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 04:57:03,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 04:57:03,321 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 04:57:03,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 04:57:03,321 INFO ]: With dead ends: 4 [2018-06-25 04:57:03,321 INFO ]: Without dead ends: 0 [2018-06-25 04:57:03,322 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 04:57:03,322 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 04:57:03,322 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 04:57:03,322 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 04:57:03,322 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 04:57:03,322 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 04:57:03,322 INFO ]: Finished accepts. word is rejected. [2018-06-25 04:57:03,322 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 04:57:03,322 INFO ]: Interpolant automaton has 8 states. [2018-06-25 04:57:03,322 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 04:57:03,322 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 04:57:03,324 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 04:57:03,325 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 04:57:03 BasicIcfg [2018-06-25 04:57:03,325 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 04:57:03,327 INFO ]: Toolchain (without parser) took 58327.17 ms. Allocated memory was 303.0 MB in the beginning and 941.1 MB in the end (delta: 638.1 MB). Free memory was 255.6 MB in the beginning and 168.4 MB in the end (delta: 87.2 MB). Peak memory consumption was 725.2 MB. Max. memory is 3.6 GB. [2018-06-25 04:57:03,328 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 04:57:03,329 INFO ]: ChcToBoogie took 80.02 ms. Allocated memory is still 303.0 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 04:57:03,329 INFO ]: Boogie Preprocessor took 48.48 ms. Allocated memory is still 303.0 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 04:57:03,329 INFO ]: RCFGBuilder took 302.44 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 237.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 04:57:03,330 INFO ]: BlockEncodingV2 took 37088.36 ms. Allocated memory was 303.0 MB in the beginning and 775.9 MB in the end (delta: 472.9 MB). Free memory was 237.6 MB in the beginning and 443.9 MB in the end (delta: -206.3 MB). Peak memory consumption was 438.4 MB. Max. memory is 3.6 GB. [2018-06-25 04:57:03,330 INFO ]: TraceAbstraction took 20786.32 ms. Allocated memory was 775.9 MB in the beginning and 941.1 MB in the end (delta: 165.2 MB). Free memory was 443.9 MB in the beginning and 168.4 MB in the end (delta: 275.5 MB). Peak memory consumption was 440.7 MB. Max. memory is 3.6 GB. [2018-06-25 04:57:03,333 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, 2059 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.0 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.02 ms. Allocated memory is still 303.0 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.48 ms. Allocated memory is still 303.0 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 302.44 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 237.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 37088.36 ms. Allocated memory was 303.0 MB in the beginning and 775.9 MB in the end (delta: 472.9 MB). Free memory was 237.6 MB in the beginning and 443.9 MB in the end (delta: -206.3 MB). Peak memory consumption was 438.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 20786.32 ms. Allocated memory was 775.9 MB in the beginning and 941.1 MB in the end (delta: 165.2 MB). Free memory was 443.9 MB in the beginning and 168.4 MB in the end (delta: 275.5 MB). Peak memory consumption was 440.7 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 20.7s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7199 SDtfs, 0 SDslu, 99 SDs, 0 SdLazy, 3236 SolverSat, 4135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=10, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 14/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_04-57-03-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_04-57-03-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_04-57-03-959.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/hysteresis_3.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_04-57-03-959.csv Received shutdown request...