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/cav12/s3_srvr_11.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:02:50,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:02:50,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:02:50,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:02:50,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:02:50,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:02:50,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:02:50,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:02:50,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:02:50,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:02:50,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:02:50,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:02:50,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:02:50,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:02:50,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:02:50,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:02:50,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:02:50,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:02:50,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:02:50,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:02:50,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:02:50,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:02:50,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:02:50,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:02:50,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:02:50,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:02:50,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:02:50,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:02:50,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:02:50,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:02:50,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:02:50,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:02:50,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:02:50,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:02:50,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:02:50,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:02:50,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:02:50,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:02:50,095 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:02:50,095 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:02:50,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:02:50,097 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:02:50,097 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:02:50,097 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:02:50,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:02:50,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:02:50,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:02:50,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:02:50,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:02:50,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:02:50,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:02:50,100 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:02:50,103 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:02:50,104 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:02:50,145 INFO ]: Repository-Root is: /tmp [2018-06-25 00:02:50,164 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:02:50,170 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:02:50,172 INFO ]: Initializing SmtParser... [2018-06-25 00:02:50,172 INFO ]: SmtParser initialized [2018-06-25 00:02:50,173 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_11.cil.smt2 [2018-06-25 00:02:50,174 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 00:02:50,265 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_11.cil.smt2 unknown [2018-06-25 00:02:50,802 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_11.cil.smt2 [2018-06-25 00:02:50,807 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:02:50,822 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:02:50,823 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:02:50,823 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:02:50,823 INFO ]: ChcToBoogie initialized [2018-06-25 00:02:50,834 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:50,940 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50 Unit [2018-06-25 00:02:50,940 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:02:50,941 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:02:50,941 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:02:50,941 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:02:50,965 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:50,965 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:50,991 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:50,992 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:51,018 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:51,020 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:51,024 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (1/1) ... [2018-06-25 00:02:51,030 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:02:51,031 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:02:51,031 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:02:51,031 INFO ]: RCFGBuilder initialized [2018-06-25 00:02:51,032 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:02:51,060 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:02:51,060 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:02:51,060 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:02:51,060 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:02:51,060 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:02:51,061 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 00:02:51,509 INFO ]: Using library mode [2018-06-25 00:02:51,510 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:02:51 BoogieIcfgContainer [2018-06-25 00:02:51,510 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:02:51,510 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:02:51,510 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:02:51,511 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:02:51,512 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:02:51" (1/1) ... [2018-06-25 00:02:51,532 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:02:51,534 INFO ]: Using Remove infeasible edges [2018-06-25 00:02:51,534 INFO ]: Using Maximize final states [2018-06-25 00:02:51,536 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:02:51,536 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:02:51,538 INFO ]: Using Remove sink states [2018-06-25 00:02:51,539 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:02:51,539 INFO ]: Using Use SBE [2018-06-25 00:02:53,082 WARN ]: Simplifying disjunction of 8880 conjuctions. This might take some time... [2018-06-25 00:03:33,453 INFO ]: Simplified to disjunction of 8880 conjuctions. [2018-06-25 00:03:34,493 INFO ]: SBE split 1 edges [2018-06-25 00:03:34,611 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:03:34,613 INFO ]: 0 new accepting states [2018-06-25 00:03:34,682 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:03:34,684 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:03:34,809 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:03:34,810 INFO ]: 0 new accepting states [2018-06-25 00:03:34,811 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:03:34,811 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:03:34,954 INFO ]: Encoded RCFG 6 locations, 1115 edges [2018-06-25 00:03:34,954 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:03:34 BasicIcfg [2018-06-25 00:03:34,955 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:03:34,956 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:03:34,956 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:03:34,959 INFO ]: TraceAbstraction initialized [2018-06-25 00:03:34,959 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:02:50" (1/4) ... [2018-06-25 00:03:34,960 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9813807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:03:34, skipping insertion in model container [2018-06-25 00:03:34,960 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:02:50" (2/4) ... [2018-06-25 00:03:34,961 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9813807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:03:34, skipping insertion in model container [2018-06-25 00:03:34,961 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:02:51" (3/4) ... [2018-06-25 00:03:34,961 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9813807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:03:34, skipping insertion in model container [2018-06-25 00:03:34,961 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:03:34" (4/4) ... [2018-06-25 00:03:34,962 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:03:34,970 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:03:34,976 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:03:35,024 INFO ]: Using default assertion order modulation [2018-06-25 00:03:35,025 INFO ]: Interprodecural is true [2018-06-25 00:03:35,025 INFO ]: Hoare is false [2018-06-25 00:03:35,025 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:03:35,025 INFO ]: Backedges is TWOTRACK [2018-06-25 00:03:35,025 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:03:35,025 INFO ]: Difference is false [2018-06-25 00:03:35,025 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:03:35,025 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:03:35,042 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:03:35,058 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:03:35,058 INFO ]: Found error trace [2018-06-25 00:03:35,059 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:03:35,059 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:35,062 INFO ]: Analyzing trace with hash 69537282, now seen corresponding path program 1 times [2018-06-25 00:03:35,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:35,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:35,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:35,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:35,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:35,173 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:35,263 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:03:35,265 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:35,265 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:35,266 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:35,277 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:35,277 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:35,280 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:03:42,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:42,364 INFO ]: Finished difference Result 7 states and 1227 transitions. [2018-06-25 00:03:42,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:42,366 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:03:42,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:42,385 INFO ]: With dead ends: 7 [2018-06-25 00:03:42,385 INFO ]: Without dead ends: 7 [2018-06-25 00:03:42,390 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 00:03:42,406 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:03:42,432 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:03:42,433 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:03:42,435 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1227 transitions. [2018-06-25 00:03:42,437 INFO ]: Start accepts. Automaton has 7 states and 1227 transitions. Word has length 5 [2018-06-25 00:03:42,437 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:42,438 INFO ]: Abstraction has 7 states and 1227 transitions. [2018-06-25 00:03:42,438 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:42,438 INFO ]: Start isEmpty. Operand 7 states and 1227 transitions. [2018-06-25 00:03:42,438 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:03:42,438 INFO ]: Found error trace [2018-06-25 00:03:42,438 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:03:42,438 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:42,439 INFO ]: Analyzing trace with hash 2142097152, now seen corresponding path program 1 times [2018-06-25 00:03:42,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:42,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:42,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:42,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:42,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:42,488 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:42,535 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:03:42,535 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:42,535 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:42,536 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:42,536 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:42,536 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:42,536 INFO ]: Start difference. First operand 7 states and 1227 transitions. Second operand 3 states. [2018-06-25 00:03:45,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:45,875 INFO ]: Finished difference Result 8 states and 1237 transitions. [2018-06-25 00:03:45,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:45,875 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:03:45,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:45,877 INFO ]: With dead ends: 8 [2018-06-25 00:03:45,877 INFO ]: Without dead ends: 8 [2018-06-25 00:03:45,877 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 00:03:45,878 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:03:45,886 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:03:45,886 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:03:45,889 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1237 transitions. [2018-06-25 00:03:45,889 INFO ]: Start accepts. Automaton has 8 states and 1237 transitions. Word has length 6 [2018-06-25 00:03:45,889 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:45,889 INFO ]: Abstraction has 8 states and 1237 transitions. [2018-06-25 00:03:45,889 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:45,889 INFO ]: Start isEmpty. Operand 8 states and 1237 transitions. [2018-06-25 00:03:45,890 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:03:45,890 INFO ]: Found error trace [2018-06-25 00:03:45,890 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:03:45,890 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:45,890 INFO ]: Analyzing trace with hash -2144081799, now seen corresponding path program 1 times [2018-06-25 00:03:45,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:45,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:45,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:45,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:45,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:45,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:45,958 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:03:45,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:45,958 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:45,958 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:45,959 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:45,959 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:45,959 INFO ]: Start difference. First operand 8 states and 1237 transitions. Second operand 3 states. [2018-06-25 00:03:49,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:49,644 INFO ]: Finished difference Result 9 states and 1239 transitions. [2018-06-25 00:03:49,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:49,645 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:03:49,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:49,647 INFO ]: With dead ends: 9 [2018-06-25 00:03:49,647 INFO ]: Without dead ends: 9 [2018-06-25 00:03:49,647 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 00:03:49,647 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:03:49,653 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:03:49,653 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:03:49,656 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1239 transitions. [2018-06-25 00:03:49,656 INFO ]: Start accepts. Automaton has 9 states and 1239 transitions. Word has length 6 [2018-06-25 00:03:49,656 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:49,656 INFO ]: Abstraction has 9 states and 1239 transitions. [2018-06-25 00:03:49,656 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:49,656 INFO ]: Start isEmpty. Operand 9 states and 1239 transitions. [2018-06-25 00:03:49,657 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:03:49,658 INFO ]: Found error trace [2018-06-25 00:03:49,658 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:49,658 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:49,658 INFO ]: Analyzing trace with hash 406886883, now seen corresponding path program 1 times [2018-06-25 00:03:49,658 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:49,658 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:49,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:49,659 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:49,659 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:49,713 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:49,773 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:03:49,774 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:49,774 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:49,774 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:49,774 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:49,774 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:49,774 INFO ]: Start difference. First operand 9 states and 1239 transitions. Second operand 3 states. [2018-06-25 00:03:53,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:53,369 INFO ]: Finished difference Result 11 states and 1338 transitions. [2018-06-25 00:03:53,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:53,370 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:03:53,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:53,372 INFO ]: With dead ends: 11 [2018-06-25 00:03:53,372 INFO ]: Without dead ends: 11 [2018-06-25 00:03:53,372 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 00:03:53,373 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:03:53,379 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:03:53,379 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:03:53,382 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1338 transitions. [2018-06-25 00:03:53,382 INFO ]: Start accepts. Automaton has 11 states and 1338 transitions. Word has length 8 [2018-06-25 00:03:53,382 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:53,382 INFO ]: Abstraction has 11 states and 1338 transitions. [2018-06-25 00:03:53,382 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:53,382 INFO ]: Start isEmpty. Operand 11 states and 1338 transitions. [2018-06-25 00:03:53,383 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:03:53,383 INFO ]: Found error trace [2018-06-25 00:03:53,383 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:53,383 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:53,383 INFO ]: Analyzing trace with hash 308070136, now seen corresponding path program 1 times [2018-06-25 00:03:53,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:53,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:53,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:53,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:53,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:53,426 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:53,477 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:03:53,477 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:53,477 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:53,477 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:53,477 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:53,477 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:53,477 INFO ]: Start difference. First operand 11 states and 1338 transitions. Second operand 3 states. [2018-06-25 00:03:56,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:56,357 INFO ]: Finished difference Result 13 states and 1490 transitions. [2018-06-25 00:03:56,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:56,359 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:03:56,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:56,361 INFO ]: With dead ends: 13 [2018-06-25 00:03:56,361 INFO ]: Without dead ends: 13 [2018-06-25 00:03:56,361 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 00:03:56,361 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:03:56,368 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:03:56,368 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:03:56,371 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1490 transitions. [2018-06-25 00:03:56,371 INFO ]: Start accepts. Automaton has 13 states and 1490 transitions. Word has length 8 [2018-06-25 00:03:56,371 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:56,371 INFO ]: Abstraction has 13 states and 1490 transitions. [2018-06-25 00:03:56,371 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:56,371 INFO ]: Start isEmpty. Operand 13 states and 1490 transitions. [2018-06-25 00:03:56,372 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:03:56,372 INFO ]: Found error trace [2018-06-25 00:03:56,372 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:56,372 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:56,372 INFO ]: Analyzing trace with hash 367175480, now seen corresponding path program 1 times [2018-06-25 00:03:56,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:56,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:56,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:56,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:56,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:56,409 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:56,495 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:03:56,496 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:56,496 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:56,496 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:56,496 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:56,496 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:56,496 INFO ]: Start difference. First operand 13 states and 1490 transitions. Second operand 3 states. [2018-06-25 00:03:59,153 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:59,153 INFO ]: Finished difference Result 15 states and 1778 transitions. [2018-06-25 00:03:59,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:59,153 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:03:59,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:59,155 INFO ]: With dead ends: 15 [2018-06-25 00:03:59,155 INFO ]: Without dead ends: 15 [2018-06-25 00:03:59,156 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 00:03:59,156 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:03:59,163 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-25 00:03:59,163 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:03:59,164 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1768 transitions. [2018-06-25 00:03:59,164 INFO ]: Start accepts. Automaton has 14 states and 1768 transitions. Word has length 8 [2018-06-25 00:03:59,165 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:59,165 INFO ]: Abstraction has 14 states and 1768 transitions. [2018-06-25 00:03:59,165 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:59,165 INFO ]: Start isEmpty. Operand 14 states and 1768 transitions. [2018-06-25 00:03:59,166 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:03:59,166 INFO ]: Found error trace [2018-06-25 00:03:59,166 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:59,166 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:59,166 INFO ]: Analyzing trace with hash -184750181, now seen corresponding path program 1 times [2018-06-25 00:03:59,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:59,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:59,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:59,167 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:59,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:59,209 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:59,309 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:03:59,309 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:59,309 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:59,309 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:59,310 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:59,310 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:59,310 INFO ]: Start difference. First operand 14 states and 1768 transitions. Second operand 3 states. [2018-06-25 00:04:02,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:04:02,377 INFO ]: Finished difference Result 21 states and 2853 transitions. [2018-06-25 00:04:02,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:04:02,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:04:02,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:04:02,404 INFO ]: With dead ends: 21 [2018-06-25 00:04:02,404 INFO ]: Without dead ends: 21 [2018-06-25 00:04:02,404 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 00:04:02,405 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:04:02,420 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-06-25 00:04:02,420 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 00:04:02,423 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2836 transitions. [2018-06-25 00:04:02,423 INFO ]: Start accepts. Automaton has 18 states and 2836 transitions. Word has length 9 [2018-06-25 00:04:02,423 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:04:02,423 INFO ]: Abstraction has 18 states and 2836 transitions. [2018-06-25 00:04:02,423 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:04:02,423 INFO ]: Start isEmpty. Operand 18 states and 2836 transitions. [2018-06-25 00:04:02,425 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:04:02,425 INFO ]: Found error trace [2018-06-25 00:04:02,425 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:04:02,425 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:04:02,425 INFO ]: Analyzing trace with hash -1006683871, now seen corresponding path program 1 times [2018-06-25 00:04:02,425 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:04:02,425 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:04:02,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:02,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:04:02,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:04:02,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:04:02,558 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:04:02,558 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:04:02,558 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:04:02,558 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:04:02,558 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:04:02,558 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:04:02,558 INFO ]: Start difference. First operand 18 states and 2836 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:04:05,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:04:05,296 WARN ]: Verification canceled [2018-06-25 00:04:05,299 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:04:05,300 WARN ]: Timeout [2018-06-25 00:04:05,300 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:04:05 BasicIcfg [2018-06-25 00:04:05,300 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:04:05,300 INFO ]: Toolchain (without parser) took 74492.92 ms. Allocated memory was 308.8 MB in the beginning and 1.1 GB in the end (delta: 786.4 MB). Free memory was 241.3 MB in the beginning and 727.3 MB in the end (delta: -486.1 MB). Peak memory consumption was 300.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,302 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:04:05,302 INFO ]: ChcToBoogie took 117.60 ms. Allocated memory is still 308.8 MB. Free memory was 241.3 MB in the beginning and 239.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,302 INFO ]: Boogie Preprocessor took 89.83 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,303 INFO ]: RCFGBuilder took 478.85 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 205.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,303 INFO ]: BlockEncodingV2 took 43444.23 ms. Allocated memory was 308.8 MB in the beginning and 401.6 MB in the end (delta: 92.8 MB). Free memory was 205.3 MB in the beginning and 238.2 MB in the end (delta: -32.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,303 INFO ]: TraceAbstraction took 30344.20 ms. Allocated memory was 401.6 MB in the beginning and 1.1 GB in the end (delta: 693.6 MB). Free memory was 238.2 MB in the beginning and 727.3 MB in the end (delta: -489.1 MB). Peak memory consumption was 204.5 MB. Max. memory is 3.6 GB. [2018-06-25 00:04:05,306 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, 1115 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 117.60 ms. Allocated memory is still 308.8 MB. Free memory was 241.3 MB in the beginning and 239.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 89.83 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 478.85 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 205.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 43444.23 ms. Allocated memory was 308.8 MB in the beginning and 401.6 MB in the end (delta: 92.8 MB). Free memory was 205.3 MB in the beginning and 238.2 MB in the end (delta: -32.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 30344.20 ms. Allocated memory was 401.6 MB in the beginning and 1.1 GB in the end (delta: 693.6 MB). Free memory was 238.2 MB in the beginning and 727.3 MB in the end (delta: -489.1 MB). Peak memory consumption was 204.5 MB. 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 constructing difference of abstraction (18states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (13 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 30.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 29.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 0 SDslu, 26 SDs, 0 SdLazy, 8277 SolverSat, 6944 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 40/40 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/s3_srvr_11.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-04-05-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_11.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-04-05-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_11.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-04-05-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_11.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-04-05-322.csv Completed graceful shutdown