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/pc_sfifo_1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:54:51,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:54:51,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:54:51,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:54:51,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:54:51,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:54:51,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:54:51,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:54:51,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:54:51,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:54:51,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:54:51,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:54:51,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:54:51,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:54:51,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:54:51,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:54:51,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:54:51,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:54:51,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:54:51,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:54:51,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:54:51,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:54:51,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:54:51,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:54:51,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:54:51,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:54:51,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:54:51,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:54:51,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:54:51,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:54:51,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:54:51,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:54:51,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:54:51,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:54:51,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:54:51,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:54:51,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:54:51,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:54:51,229 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:54:51,229 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:54:51,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:54:51,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:54:51,230 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:54:51,230 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:54:51,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:54:51,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:54:51,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:54:51,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:54:51,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:54:51,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:54:51,233 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:54:51,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:54:51,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:54:51,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:54:51,234 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:54:51,234 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:54:51,234 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:54:51,235 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:54:51,235 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:54:51,291 INFO ]: Repository-Root is: /tmp [2018-06-24 23:54:51,309 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:54:51,315 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:54:51,316 INFO ]: Initializing SmtParser... [2018-06-24 23:54:51,316 INFO ]: SmtParser initialized [2018-06-24 23:54:51,317 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/pc_sfifo_1.smt2 [2018-06-24 23:54:51,318 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 23:54:51,399 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/pc_sfifo_1.smt2 unknown [2018-06-24 23:54:51,838 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/pc_sfifo_1.smt2 [2018-06-24 23:54:51,843 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:54:51,848 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:54:51,848 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:54:51,848 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:54:51,848 INFO ]: ChcToBoogie initialized [2018-06-24 23:54:51,851 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:51,947 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51 Unit [2018-06-24 23:54:51,947 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:54:51,947 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:54:51,947 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:54:51,948 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:54:51,973 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:51,973 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:51,992 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:51,992 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:52,010 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:52,011 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:52,014 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... [2018-06-24 23:54:52,027 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:54:52,028 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:54:52,028 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:54:52,028 INFO ]: RCFGBuilder initialized [2018-06-24 23:54:52,029 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 23:54:52,050 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:54:52,050 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:54:52,050 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:54:52,050 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:54:52,050 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:54:52,050 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:54:52,457 INFO ]: Using library mode [2018-06-24 23:54:52,461 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:52 BoogieIcfgContainer [2018-06-24 23:54:52,462 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:54:52,462 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:54:52,462 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:54:52,463 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:54:52,464 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:52" (1/1) ... [2018-06-24 23:54:52,484 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:54:52,485 INFO ]: Using Remove infeasible edges [2018-06-24 23:54:52,486 INFO ]: Using Maximize final states [2018-06-24 23:54:52,487 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:54:52,487 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:54:52,489 INFO ]: Using Remove sink states [2018-06-24 23:54:52,491 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:54:52,491 INFO ]: Using Use SBE [2018-06-24 23:54:52,862 INFO ]: SBE split 1 edges [2018-06-24 23:54:52,869 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:54:52,872 INFO ]: 0 new accepting states [2018-06-24 23:54:52,947 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:54:52,949 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:54:52,956 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:54:52,956 INFO ]: 0 new accepting states [2018-06-24 23:54:52,956 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:54:52,956 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:54:52,958 INFO ]: Encoded RCFG 6 locations, 50 edges [2018-06-24 23:54:52,959 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:54:52 BasicIcfg [2018-06-24 23:54:52,959 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:54:52,959 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:54:52,959 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:54:52,963 INFO ]: TraceAbstraction initialized [2018-06-24 23:54:52,963 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:54:51" (1/4) ... [2018-06-24 23:54:52,964 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcb62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:54:52, skipping insertion in model container [2018-06-24 23:54:52,964 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:54:51" (2/4) ... [2018-06-24 23:54:52,964 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcb62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:54:52, skipping insertion in model container [2018-06-24 23:54:52,964 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:54:52" (3/4) ... [2018-06-24 23:54:52,964 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcb62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:54:52, skipping insertion in model container [2018-06-24 23:54:52,964 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:54:52" (4/4) ... [2018-06-24 23:54:52,966 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:54:52,975 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:54:52,983 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:54:53,028 INFO ]: Using default assertion order modulation [2018-06-24 23:54:53,029 INFO ]: Interprodecural is true [2018-06-24 23:54:53,029 INFO ]: Hoare is false [2018-06-24 23:54:53,029 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:54:53,029 INFO ]: Backedges is TWOTRACK [2018-06-24 23:54:53,029 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:54:53,029 INFO ]: Difference is false [2018-06-24 23:54:53,029 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:54:53,029 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:54:53,043 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:54:53,056 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:54:53,056 INFO ]: Found error trace [2018-06-24 23:54:53,058 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:54:53,059 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:53,066 INFO ]: Analyzing trace with hash 36786402, now seen corresponding path program 1 times [2018-06-24 23:54:53,068 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:53,068 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:53,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:53,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:53,178 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:53,317 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:53,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:53,320 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:53,322 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:53,336 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:53,337 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:53,339 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:54:54,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:54,333 INFO ]: Finished difference Result 7 states and 50 transitions. [2018-06-24 23:54:54,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:54,334 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:54:54,335 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:54,346 INFO ]: With dead ends: 7 [2018-06-24 23:54:54,346 INFO ]: Without dead ends: 7 [2018-06-24 23:54:54,356 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:54,378 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:54:54,399 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:54:54,400 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:54:54,401 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-06-24 23:54:54,403 INFO ]: Start accepts. Automaton has 7 states and 50 transitions. Word has length 5 [2018-06-24 23:54:54,404 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:54,404 INFO ]: Abstraction has 7 states and 50 transitions. [2018-06-24 23:54:54,404 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:54,404 INFO ]: Start isEmpty. Operand 7 states and 50 transitions. [2018-06-24 23:54:54,404 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:54:54,404 INFO ]: Found error trace [2018-06-24 23:54:54,404 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:54:54,404 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:54,405 INFO ]: Analyzing trace with hash 1139976923, now seen corresponding path program 1 times [2018-06-24 23:54:54,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:54,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:54,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:54,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:54,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:54,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:54,518 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:54,518 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:54,519 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:54,520 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:54,520 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:54,520 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:54,520 INFO ]: Start difference. First operand 7 states and 50 transitions. Second operand 3 states. [2018-06-24 23:54:54,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:54,993 INFO ]: Finished difference Result 9 states and 72 transitions. [2018-06-24 23:54:54,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:54,994 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:54:54,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:54,994 INFO ]: With dead ends: 9 [2018-06-24 23:54:54,994 INFO ]: Without dead ends: 9 [2018-06-24 23:54:54,995 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:54,995 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:54:54,997 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:54:54,997 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:54:54,998 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2018-06-24 23:54:54,998 INFO ]: Start accepts. Automaton has 9 states and 72 transitions. Word has length 6 [2018-06-24 23:54:54,998 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:54,998 INFO ]: Abstraction has 9 states and 72 transitions. [2018-06-24 23:54:54,998 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:54,998 INFO ]: Start isEmpty. Operand 9 states and 72 transitions. [2018-06-24 23:54:54,998 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:54,998 INFO ]: Found error trace [2018-06-24 23:54:54,998 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:54,999 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:54,999 INFO ]: Analyzing trace with hash 977923275, now seen corresponding path program 1 times [2018-06-24 23:54:54,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:54,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:55,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:55,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,028 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:55,136 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:55,136 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:55,136 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:55,136 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:55,136 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:55,136 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,136 INFO ]: Start difference. First operand 9 states and 72 transitions. Second operand 3 states. [2018-06-24 23:54:55,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:55,295 INFO ]: Finished difference Result 13 states and 113 transitions. [2018-06-24 23:54:55,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:55,296 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:55,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:55,297 INFO ]: With dead ends: 13 [2018-06-24 23:54:55,297 INFO ]: Without dead ends: 13 [2018-06-24 23:54:55,297 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,297 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 23:54:55,301 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 23:54:55,301 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 23:54:55,302 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2018-06-24 23:54:55,302 INFO ]: Start accepts. Automaton has 13 states and 113 transitions. Word has length 7 [2018-06-24 23:54:55,302 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:55,302 INFO ]: Abstraction has 13 states and 113 transitions. [2018-06-24 23:54:55,302 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:55,302 INFO ]: Start isEmpty. Operand 13 states and 113 transitions. [2018-06-24 23:54:55,303 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:54:55,304 INFO ]: Found error trace [2018-06-24 23:54:55,304 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:55,304 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:55,304 INFO ]: Analyzing trace with hash 978787214, now seen corresponding path program 1 times [2018-06-24 23:54:55,304 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:55,304 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:55,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,305 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:55,305 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,324 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:55,369 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:54:55,369 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:55,369 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:55,369 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:55,369 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:55,369 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,369 INFO ]: Start difference. First operand 13 states and 113 transitions. Second operand 3 states. [2018-06-24 23:54:55,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:55,504 INFO ]: Finished difference Result 19 states and 157 transitions. [2018-06-24 23:54:55,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:55,505 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:54:55,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:55,506 INFO ]: With dead ends: 19 [2018-06-24 23:54:55,506 INFO ]: Without dead ends: 19 [2018-06-24 23:54:55,506 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,506 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 23:54:55,511 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 23:54:55,511 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 23:54:55,512 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 157 transitions. [2018-06-24 23:54:55,512 INFO ]: Start accepts. Automaton has 19 states and 157 transitions. Word has length 7 [2018-06-24 23:54:55,512 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:55,512 INFO ]: Abstraction has 19 states and 157 transitions. [2018-06-24 23:54:55,512 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:55,512 INFO ]: Start isEmpty. Operand 19 states and 157 transitions. [2018-06-24 23:54:55,513 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 23:54:55,513 INFO ]: Found error trace [2018-06-24 23:54:55,513 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:55,513 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:55,513 INFO ]: Analyzing trace with hash -1008647822, now seen corresponding path program 1 times [2018-06-24 23:54:55,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:55,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:55,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:55,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,532 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:55,591 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 23:54:55,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:55,591 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:55,591 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:55,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:55,591 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,591 INFO ]: Start difference. First operand 19 states and 157 transitions. Second operand 3 states. [2018-06-24 23:54:55,915 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:55,915 INFO ]: Finished difference Result 19 states and 104 transitions. [2018-06-24 23:54:55,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:55,916 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 23:54:55,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:55,917 INFO ]: With dead ends: 19 [2018-06-24 23:54:55,917 INFO ]: Without dead ends: 19 [2018-06-24 23:54:55,917 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:55,917 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 23:54:55,925 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 23:54:55,925 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 23:54:55,926 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2018-06-24 23:54:55,926 INFO ]: Start accepts. Automaton has 19 states and 104 transitions. Word has length 9 [2018-06-24 23:54:55,926 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:55,926 INFO ]: Abstraction has 19 states and 104 transitions. [2018-06-24 23:54:55,926 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:55,926 INFO ]: Start isEmpty. Operand 19 states and 104 transitions. [2018-06-24 23:54:55,927 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:54:55,927 INFO ]: Found error trace [2018-06-24 23:54:55,927 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:55,927 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:55,927 INFO ]: Analyzing trace with hash 1059214999, now seen corresponding path program 1 times [2018-06-24 23:54:55,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:55,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:55,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:55,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:55,975 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:56,068 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 23:54:56,068 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:56,068 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:56,068 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:56,068 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:56,068 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,068 INFO ]: Start difference. First operand 19 states and 104 transitions. Second operand 3 states. [2018-06-24 23:54:56,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:56,252 INFO ]: Finished difference Result 31 states and 181 transitions. [2018-06-24 23:54:56,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:56,252 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:54:56,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:56,253 INFO ]: With dead ends: 31 [2018-06-24 23:54:56,253 INFO ]: Without dead ends: 31 [2018-06-24 23:54:56,253 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,254 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 23:54:56,257 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 23:54:56,257 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 23:54:56,259 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 181 transitions. [2018-06-24 23:54:56,259 INFO ]: Start accepts. Automaton has 31 states and 181 transitions. Word has length 11 [2018-06-24 23:54:56,259 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:56,259 INFO ]: Abstraction has 31 states and 181 transitions. [2018-06-24 23:54:56,259 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:56,259 INFO ]: Start isEmpty. Operand 31 states and 181 transitions. [2018-06-24 23:54:56,260 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 23:54:56,260 INFO ]: Found error trace [2018-06-24 23:54:56,260 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:56,260 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:56,260 INFO ]: Analyzing trace with hash -122482876, now seen corresponding path program 1 times [2018-06-24 23:54:56,260 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:56,260 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:56,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,261 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:56,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:56,357 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 23:54:56,357 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:56,358 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:56,358 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:56,358 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:56,358 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,358 INFO ]: Start difference. First operand 31 states and 181 transitions. Second operand 3 states. [2018-06-24 23:54:56,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:56,580 INFO ]: Finished difference Result 55 states and 330 transitions. [2018-06-24 23:54:56,581 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:56,581 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-24 23:54:56,581 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:56,583 INFO ]: With dead ends: 55 [2018-06-24 23:54:56,583 INFO ]: Without dead ends: 55 [2018-06-24 23:54:56,583 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,583 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 23:54:56,590 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-24 23:54:56,590 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 23:54:56,593 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 330 transitions. [2018-06-24 23:54:56,593 INFO ]: Start accepts. Automaton has 55 states and 330 transitions. Word has length 11 [2018-06-24 23:54:56,593 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:56,593 INFO ]: Abstraction has 55 states and 330 transitions. [2018-06-24 23:54:56,593 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:56,593 INFO ]: Start isEmpty. Operand 55 states and 330 transitions. [2018-06-24 23:54:56,594 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 23:54:56,594 INFO ]: Found error trace [2018-06-24 23:54:56,594 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:56,595 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:56,595 INFO ]: Analyzing trace with hash -314517501, now seen corresponding path program 1 times [2018-06-24 23:54:56,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:56,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:56,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:56,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:56,624 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:56,716 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 23:54:56,716 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:56,716 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:56,716 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:56,717 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:56,717 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:56,717 INFO ]: Start difference. First operand 55 states and 330 transitions. Second operand 3 states. [2018-06-24 23:54:57,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:57,023 INFO ]: Finished difference Result 93 states and 524 transitions. [2018-06-24 23:54:57,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:57,024 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-24 23:54:57,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:57,026 INFO ]: With dead ends: 93 [2018-06-24 23:54:57,026 INFO ]: Without dead ends: 89 [2018-06-24 23:54:57,027 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,027 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-24 23:54:57,040 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-06-24 23:54:57,040 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 23:54:57,042 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 498 transitions. [2018-06-24 23:54:57,042 INFO ]: Start accepts. Automaton has 86 states and 498 transitions. Word has length 12 [2018-06-24 23:54:57,043 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:57,043 INFO ]: Abstraction has 86 states and 498 transitions. [2018-06-24 23:54:57,043 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:57,043 INFO ]: Start isEmpty. Operand 86 states and 498 transitions. [2018-06-24 23:54:57,044 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:57,044 INFO ]: Found error trace [2018-06-24 23:54:57,044 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:57,044 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:57,044 INFO ]: Analyzing trace with hash -991412654, now seen corresponding path program 1 times [2018-06-24 23:54:57,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:57,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:57,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,045 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:57,045 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,077 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:57,167 INFO ]: Checked inductivity of 66 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-24 23:54:57,167 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:57,167 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:57,167 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:57,167 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:57,167 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,167 INFO ]: Start difference. First operand 86 states and 498 transitions. Second operand 3 states. [2018-06-24 23:54:57,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:57,381 INFO ]: Finished difference Result 161 states and 902 transitions. [2018-06-24 23:54:57,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:57,381 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:57,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:57,384 INFO ]: With dead ends: 161 [2018-06-24 23:54:57,384 INFO ]: Without dead ends: 161 [2018-06-24 23:54:57,385 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,385 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-24 23:54:57,406 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 156. [2018-06-24 23:54:57,406 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-24 23:54:57,409 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 892 transitions. [2018-06-24 23:54:57,409 INFO ]: Start accepts. Automaton has 156 states and 892 transitions. Word has length 16 [2018-06-24 23:54:57,409 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:57,409 INFO ]: Abstraction has 156 states and 892 transitions. [2018-06-24 23:54:57,409 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:57,409 INFO ]: Start isEmpty. Operand 156 states and 892 transitions. [2018-06-24 23:54:57,414 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:57,414 INFO ]: Found error trace [2018-06-24 23:54:57,414 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:57,414 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:57,414 INFO ]: Analyzing trace with hash -376507047, now seen corresponding path program 1 times [2018-06-24 23:54:57,415 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:57,415 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:57,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,415 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:57,415 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,452 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:57,528 INFO ]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-24 23:54:57,529 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:57,529 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:57,529 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:57,529 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:57,529 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,529 INFO ]: Start difference. First operand 156 states and 892 transitions. Second operand 3 states. [2018-06-24 23:54:57,686 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:57,686 INFO ]: Finished difference Result 156 states and 611 transitions. [2018-06-24 23:54:57,687 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:57,687 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:57,687 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:57,689 INFO ]: With dead ends: 156 [2018-06-24 23:54:57,689 INFO ]: Without dead ends: 156 [2018-06-24 23:54:57,689 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,689 INFO ]: Start minimizeSevpa. Operand 156 states. [2018-06-24 23:54:57,700 INFO ]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-06-24 23:54:57,700 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-24 23:54:57,702 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 553 transitions. [2018-06-24 23:54:57,703 INFO ]: Start accepts. Automaton has 141 states and 553 transitions. Word has length 16 [2018-06-24 23:54:57,703 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:57,703 INFO ]: Abstraction has 141 states and 553 transitions. [2018-06-24 23:54:57,703 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:57,703 INFO ]: Start isEmpty. Operand 141 states and 553 transitions. [2018-06-24 23:54:57,704 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:57,704 INFO ]: Found error trace [2018-06-24 23:54:57,704 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:57,704 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:57,705 INFO ]: Analyzing trace with hash 381217159, now seen corresponding path program 1 times [2018-06-24 23:54:57,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:57,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:57,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,705 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:57,705 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:57,733 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:57,820 INFO ]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-24 23:54:57,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:57,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:57,820 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:57,820 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:57,820 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:57,820 INFO ]: Start difference. First operand 141 states and 553 transitions. Second operand 3 states. [2018-06-24 23:54:58,274 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:58,274 INFO ]: Finished difference Result 209 states and 809 transitions. [2018-06-24 23:54:58,278 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:58,278 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:58,278 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:58,280 INFO ]: With dead ends: 209 [2018-06-24 23:54:58,280 INFO ]: Without dead ends: 209 [2018-06-24 23:54:58,281 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:58,281 INFO ]: Start minimizeSevpa. Operand 209 states. [2018-06-24 23:54:58,295 INFO ]: Finished minimizeSevpa. Reduced states from 209 to 176. [2018-06-24 23:54:58,295 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-24 23:54:58,298 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 695 transitions. [2018-06-24 23:54:58,298 INFO ]: Start accepts. Automaton has 176 states and 695 transitions. Word has length 16 [2018-06-24 23:54:58,298 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:58,298 INFO ]: Abstraction has 176 states and 695 transitions. [2018-06-24 23:54:58,298 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:58,298 INFO ]: Start isEmpty. Operand 176 states and 695 transitions. [2018-06-24 23:54:58,300 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:58,300 INFO ]: Found error trace [2018-06-24 23:54:58,300 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:58,300 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:58,300 INFO ]: Analyzing trace with hash -1810642673, now seen corresponding path program 1 times [2018-06-24 23:54:58,300 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:58,300 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:58,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,301 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:58,301 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,330 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:58,383 INFO ]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-24 23:54:58,383 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:58,383 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:58,383 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:58,383 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:58,383 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:58,384 INFO ]: Start difference. First operand 176 states and 695 transitions. Second operand 3 states. [2018-06-24 23:54:58,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:58,628 INFO ]: Finished difference Result 333 states and 1232 transitions. [2018-06-24 23:54:58,629 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:58,629 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:58,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:58,632 INFO ]: With dead ends: 333 [2018-06-24 23:54:58,632 INFO ]: Without dead ends: 333 [2018-06-24 23:54:58,632 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:58,632 INFO ]: Start minimizeSevpa. Operand 333 states. [2018-06-24 23:54:58,673 INFO ]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-06-24 23:54:58,674 INFO ]: Start removeUnreachable. Operand 332 states. [2018-06-24 23:54:58,677 INFO ]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1230 transitions. [2018-06-24 23:54:58,677 INFO ]: Start accepts. Automaton has 332 states and 1230 transitions. Word has length 16 [2018-06-24 23:54:58,677 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:58,677 INFO ]: Abstraction has 332 states and 1230 transitions. [2018-06-24 23:54:58,678 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:58,678 INFO ]: Start isEmpty. Operand 332 states and 1230 transitions. [2018-06-24 23:54:58,680 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:58,680 INFO ]: Found error trace [2018-06-24 23:54:58,680 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:58,680 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:58,681 INFO ]: Analyzing trace with hash 1123387397, now seen corresponding path program 1 times [2018-06-24 23:54:58,681 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:58,681 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:58,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:58,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:58,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:58,795 INFO ]: Checked inductivity of 66 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-24 23:54:58,795 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:54:58,796 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:54:58,796 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:54:58,796 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:54:58,796 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:58,796 INFO ]: Start difference. First operand 332 states and 1230 transitions. Second operand 3 states. [2018-06-24 23:54:59,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:54:59,019 INFO ]: Finished difference Result 264 states and 626 transitions. [2018-06-24 23:54:59,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:54:59,019 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-24 23:54:59,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:54:59,020 INFO ]: With dead ends: 264 [2018-06-24 23:54:59,020 INFO ]: Without dead ends: 196 [2018-06-24 23:54:59,021 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:54:59,021 INFO ]: Start minimizeSevpa. Operand 196 states. [2018-06-24 23:54:59,028 INFO ]: Finished minimizeSevpa. Reduced states from 196 to 187. [2018-06-24 23:54:59,028 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-24 23:54:59,029 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 472 transitions. [2018-06-24 23:54:59,029 INFO ]: Start accepts. Automaton has 187 states and 472 transitions. Word has length 16 [2018-06-24 23:54:59,029 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:54:59,029 INFO ]: Abstraction has 187 states and 472 transitions. [2018-06-24 23:54:59,029 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:54:59,029 INFO ]: Start isEmpty. Operand 187 states and 472 transitions. [2018-06-24 23:54:59,031 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 23:54:59,031 INFO ]: Found error trace [2018-06-24 23:54:59,031 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:54:59,031 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:54:59,031 INFO ]: Analyzing trace with hash 665320981, now seen corresponding path program 1 times [2018-06-24 23:54:59,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:54:59,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:54:59,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:59,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:59,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:54:59,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:59,220 INFO ]: Checked inductivity of 66 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 23:54:59,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 23:54:59,220 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-24 23:54:59,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:54:59,501 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:54:59,522 INFO ]: Computing forward predicates... [2018-06-24 23:54:59,692 INFO ]: Checked inductivity of 66 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-24 23:54:59,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 23:54:59,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 23:54:59,715 INFO ]: Interpolant automaton has 6 states [2018-06-24 23:54:59,716 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 23:54:59,716 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:54:59,716 INFO ]: Start difference. First operand 187 states and 472 transitions. Second operand 6 states. [2018-06-24 23:55:00,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:00,081 INFO ]: Finished difference Result 368 states and 919 transitions. [2018-06-24 23:55:00,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 23:55:00,081 INFO ]: Start accepts. Automaton has 6 states. Word has length 16 [2018-06-24 23:55:00,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:00,084 INFO ]: With dead ends: 368 [2018-06-24 23:55:00,084 INFO ]: Without dead ends: 368 [2018-06-24 23:55:00,085 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 23:55:00,085 INFO ]: Start minimizeSevpa. Operand 368 states. [2018-06-24 23:55:00,096 INFO ]: Finished minimizeSevpa. Reduced states from 368 to 284. [2018-06-24 23:55:00,096 INFO ]: Start removeUnreachable. Operand 284 states. [2018-06-24 23:55:00,098 INFO ]: Finished removeUnreachable. Reduced from 284 states to 284 states and 721 transitions. [2018-06-24 23:55:00,098 INFO ]: Start accepts. Automaton has 284 states and 721 transitions. Word has length 16 [2018-06-24 23:55:00,098 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:00,098 INFO ]: Abstraction has 284 states and 721 transitions. [2018-06-24 23:55:00,098 INFO ]: Interpolant automaton has 6 states. [2018-06-24 23:55:00,098 INFO ]: Start isEmpty. Operand 284 states and 721 transitions. [2018-06-24 23:55:00,099 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 23:55:00,099 INFO ]: Found error trace [2018-06-24 23:55:00,099 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:00,100 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:00,100 INFO ]: Analyzing trace with hash 1992732993, now seen corresponding path program 2 times [2018-06-24 23:55:00,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:00,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:00,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:00,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,131 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:00,279 INFO ]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 23:55:00,279 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:00,279 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:00,279 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:00,279 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:00,279 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:00,279 INFO ]: Start difference. First operand 284 states and 721 transitions. Second operand 3 states. [2018-06-24 23:55:00,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:00,640 INFO ]: Finished difference Result 376 states and 860 transitions. [2018-06-24 23:55:00,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:00,640 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-24 23:55:00,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:00,642 INFO ]: With dead ends: 376 [2018-06-24 23:55:00,642 INFO ]: Without dead ends: 242 [2018-06-24 23:55:00,642 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:00,642 INFO ]: Start minimizeSevpa. Operand 242 states. [2018-06-24 23:55:00,648 INFO ]: Finished minimizeSevpa. Reduced states from 242 to 152. [2018-06-24 23:55:00,648 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-24 23:55:00,649 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 370 transitions. [2018-06-24 23:55:00,649 INFO ]: Start accepts. Automaton has 152 states and 370 transitions. Word has length 18 [2018-06-24 23:55:00,649 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:00,649 INFO ]: Abstraction has 152 states and 370 transitions. [2018-06-24 23:55:00,649 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:00,649 INFO ]: Start isEmpty. Operand 152 states and 370 transitions. [2018-06-24 23:55:00,650 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 23:55:00,650 INFO ]: Found error trace [2018-06-24 23:55:00,650 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:00,650 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:00,650 INFO ]: Analyzing trace with hash -1300810285, now seen corresponding path program 1 times [2018-06-24 23:55:00,650 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:00,650 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:00,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,652 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 23:55:00,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:00,683 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:00,771 INFO ]: Checked inductivity of 120 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 23:55:00,771 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:00,771 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:00,771 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:00,771 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:00,771 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:00,771 INFO ]: Start difference. First operand 152 states and 370 transitions. Second operand 3 states. [2018-06-24 23:55:01,247 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:01,247 INFO ]: Finished difference Result 145 states and 214 transitions. [2018-06-24 23:55:01,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:01,247 INFO ]: Start accepts. Automaton has 3 states. Word has length 20 [2018-06-24 23:55:01,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:01,248 INFO ]: With dead ends: 145 [2018-06-24 23:55:01,248 INFO ]: Without dead ends: 82 [2018-06-24 23:55:01,248 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:01,248 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-24 23:55:01,250 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-06-24 23:55:01,250 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 23:55:01,250 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2018-06-24 23:55:01,250 INFO ]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 20 [2018-06-24 23:55:01,250 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:01,250 INFO ]: Abstraction has 66 states and 95 transitions. [2018-06-24 23:55:01,250 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:01,251 INFO ]: Start isEmpty. Operand 66 states and 95 transitions. [2018-06-24 23:55:01,251 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 23:55:01,251 INFO ]: Found error trace [2018-06-24 23:55:01,251 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:55:01,251 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:55:01,251 INFO ]: Analyzing trace with hash 879898475, now seen corresponding path program 1 times [2018-06-24 23:55:01,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:55:01,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:55:01,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:01,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:55:01,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:55:01,289 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:55:01,397 INFO ]: Checked inductivity of 171 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-24 23:55:01,397 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:55:01,397 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:55:01,397 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:55:01,397 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:55:01,397 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:01,398 INFO ]: Start difference. First operand 66 states and 95 transitions. Second operand 3 states. [2018-06-24 23:55:01,620 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:55:01,620 INFO ]: Finished difference Result 45 states and 55 transitions. [2018-06-24 23:55:01,621 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:55:01,621 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-24 23:55:01,621 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:55:01,621 INFO ]: With dead ends: 45 [2018-06-24 23:55:01,621 INFO ]: Without dead ends: 0 [2018-06-24 23:55:01,621 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:55:01,621 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-24 23:55:01,621 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-24 23:55:01,621 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-24 23:55:01,621 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-24 23:55:01,621 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-06-24 23:55:01,621 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:55:01,621 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-24 23:55:01,621 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:55:01,621 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-24 23:55:01,621 INFO ]: Finished isEmpty. No accepting run. [2018-06-24 23:55:01,623 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 23:55:01,624 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:55:01 BasicIcfg [2018-06-24 23:55:01,624 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 23:55:01,625 INFO ]: Toolchain (without parser) took 9781.81 ms. Allocated memory was 308.8 MB in the beginning and 441.5 MB in the end (delta: 132.6 MB). Free memory was 245.2 MB in the beginning and 296.7 MB in the end (delta: -51.4 MB). Peak memory consumption was 81.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,626 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 23:55:01,626 INFO ]: ChcToBoogie took 98.95 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 242.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,627 INFO ]: Boogie Preprocessor took 79.83 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 240.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,627 INFO ]: RCFGBuilder took 433.88 ms. Allocated memory is still 308.8 MB. Free memory was 240.1 MB in the beginning and 216.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,628 INFO ]: BlockEncodingV2 took 496.53 ms. Allocated memory was 308.8 MB in the beginning and 328.2 MB in the end (delta: 19.4 MB). Free memory was 215.0 MB in the beginning and 296.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,628 INFO ]: TraceAbstraction took 8664.57 ms. Allocated memory was 328.2 MB in the beginning and 441.5 MB in the end (delta: 113.2 MB). Free memory was 296.0 MB in the beginning and 296.7 MB in the end (delta: -730.8 kB). Peak memory consumption was 112.5 MB. Max. memory is 3.6 GB. [2018-06-24 23:55:01,631 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, 50 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 98.95 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 242.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 79.83 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 240.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 433.88 ms. Allocated memory is still 308.8 MB. Free memory was 240.1 MB in the beginning and 216.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 496.53 ms. Allocated memory was 308.8 MB in the beginning and 328.2 MB in the end (delta: 19.4 MB). Free memory was 215.0 MB in the beginning and 296.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 8664.57 ms. Allocated memory was 328.2 MB in the beginning and 441.5 MB in the end (delta: 113.2 MB). Free memory was 296.0 MB in the beginning and 296.7 MB in the end (delta: -730.8 kB). Peak memory consumption was 112.5 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, 8.6s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 3 SDslu, 69 SDs, 0 SdLazy, 1142 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=12, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 256 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 6125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1862 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 891/931 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/pc_sfifo_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_23-55-01-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/pc_sfifo_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_23-55-01-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/pc_sfifo_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_23-55-01-641.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/pc_sfifo_1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_23-55-01-641.csv Received shutdown request...