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_4.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:47:48,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:47:48,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:47:48,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:47:48,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:47:48,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:47:48,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:47:48,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:47:48,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:47:48,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:47:48,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:47:48,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:47:48,892 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:47:48,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:47:48,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:47:48,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:47:48,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:47:48,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:47:48,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:47:48,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:47:48,913 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:47:48,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:47:48,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:47:48,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:47:48,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:47:48,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:47:48,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:47:48,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:47:48,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:47:48,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:47:48,921 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:47:48,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:47:48,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:47:48,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:47:48,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:47:48,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:47:48,927 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:47:48,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:47:48,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:47:48,942 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:47:48,943 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:47:48,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:47:48,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:47:48,944 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:47:48,944 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:47:48,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:47:48,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:47:48,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:47:48,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:47:48,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:47:48,947 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:47:48,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:47:48,949 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:47:48,950 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:47:48,950 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:47:49,002 INFO ]: Repository-Root is: /tmp [2018-06-26 20:47:49,018 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:47:49,023 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:47:49,025 INFO ]: Initializing SmtParser... [2018-06-26 20:47:49,025 INFO ]: SmtParser initialized [2018-06-26 20:47:49,025 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 [2018-06-26 20:47:49,027 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:47:49,112 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 unknown [2018-06-26 20:47:49,552 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_4.cil.smt2 [2018-06-26 20:47:49,566 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:47:49,581 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:47:49,581 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:47:49,581 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:47:49,581 INFO ]: ChcToBoogie initialized [2018-06-26 20:47:49,584 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,709 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49 Unit [2018-06-26 20:47:49,709 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:47:49,710 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:47:49,710 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:47:49,710 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:47:49,732 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,732 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,753 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,753 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,773 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,774 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,778 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... [2018-06-26 20:47:49,794 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:47:49,795 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:47:49,795 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:47:49,795 INFO ]: RCFGBuilder initialized [2018-06-26 20:47:49,797 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 20:47:49,805 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:47:49,805 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:47:49,805 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:47:49,805 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:47:49,805 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:47:49,805 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:47:50,217 INFO ]: Using library mode [2018-06-26 20:47:50,217 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:50 BoogieIcfgContainer [2018-06-26 20:47:50,217 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:47:50,218 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:47:50,221 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:47:50,221 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:47:50,222 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:50" (1/1) ... [2018-06-26 20:47:50,240 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:47:50,241 INFO ]: Using Remove infeasible edges [2018-06-26 20:47:50,242 INFO ]: Using Maximize final states [2018-06-26 20:47:50,242 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:47:50,242 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:47:50,251 INFO ]: Using Remove sink states [2018-06-26 20:47:50,252 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:47:50,252 INFO ]: Using Use SBE [2018-06-26 20:47:52,117 INFO ]: SBE split 1 edges [2018-06-26 20:47:52,174 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:47:52,176 INFO ]: 0 new accepting states [2018-06-26 20:47:52,239 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:47:52,241 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:47:52,326 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:47:52,327 INFO ]: 0 new accepting states [2018-06-26 20:47:52,328 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:47:52,328 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:47:52,445 INFO ]: Encoded RCFG 6 locations, 868 edges [2018-06-26 20:47:52,445 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:47:52 BasicIcfg [2018-06-26 20:47:52,445 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:47:52,447 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:47:52,447 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:47:52,451 INFO ]: TraceAbstraction initialized [2018-06-26 20:47:52,451 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:47:49" (1/4) ... [2018-06-26 20:47:52,452 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4c65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:47:52, skipping insertion in model container [2018-06-26 20:47:52,452 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:47:49" (2/4) ... [2018-06-26 20:47:52,453 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4c65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:47:52, skipping insertion in model container [2018-06-26 20:47:52,453 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:47:50" (3/4) ... [2018-06-26 20:47:52,453 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4c65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:47:52, skipping insertion in model container [2018-06-26 20:47:52,453 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:47:52" (4/4) ... [2018-06-26 20:47:52,455 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:47:52,464 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:47:52,474 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:47:52,526 INFO ]: Using default assertion order modulation [2018-06-26 20:47:52,527 INFO ]: Interprodecural is true [2018-06-26 20:47:52,527 INFO ]: Hoare is false [2018-06-26 20:47:52,527 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:47:52,527 INFO ]: Backedges is TWOTRACK [2018-06-26 20:47:52,527 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:47:52,527 INFO ]: Difference is false [2018-06-26 20:47:52,527 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:47:52,527 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:47:52,548 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:47:52,575 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:47:52,575 INFO ]: Found error trace [2018-06-26 20:47:52,576 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:47:52,576 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:52,582 INFO ]: Analyzing trace with hash 61941538, now seen corresponding path program 1 times [2018-06-26 20:47:52,584 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:52,584 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:52,630 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:52,630 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:52,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:52,702 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:52,800 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:47:52,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:52,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:52,822 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:52,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:52,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:52,835 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:47:58,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:47:58,358 INFO ]: Finished difference Result 7 states and 957 transitions. [2018-06-26 20:47:58,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:47:58,360 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:47:58,360 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:47:58,383 INFO ]: With dead ends: 7 [2018-06-26 20:47:58,383 INFO ]: Without dead ends: 7 [2018-06-26 20:47:58,385 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:58,412 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:47:58,453 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:47:58,455 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:47:58,457 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 957 transitions. [2018-06-26 20:47:58,459 INFO ]: Start accepts. Automaton has 7 states and 957 transitions. Word has length 5 [2018-06-26 20:47:58,459 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:47:58,459 INFO ]: Abstraction has 7 states and 957 transitions. [2018-06-26 20:47:58,460 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:47:58,460 INFO ]: Start isEmpty. Operand 7 states and 957 transitions. [2018-06-26 20:47:58,461 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:47:58,461 INFO ]: Found error trace [2018-06-26 20:47:58,461 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:47:58,461 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:47:58,461 INFO ]: Analyzing trace with hash 1913660725, now seen corresponding path program 1 times [2018-06-26 20:47:58,461 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:47:58,461 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:47:58,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:58,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:47:58,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:47:58,529 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:47:58,619 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:47:58,619 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:47:58,619 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:47:58,620 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:47:58,621 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:47:58,621 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:47:58,621 INFO ]: Start difference. First operand 7 states and 957 transitions. Second operand 3 states. [2018-06-26 20:48:01,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:01,322 INFO ]: Finished difference Result 8 states and 959 transitions. [2018-06-26 20:48:01,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:01,322 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:48:01,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:01,323 INFO ]: With dead ends: 8 [2018-06-26 20:48:01,323 INFO ]: Without dead ends: 8 [2018-06-26 20:48:01,324 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:01,324 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:48:01,338 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:48:01,338 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:48:01,340 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 959 transitions. [2018-06-26 20:48:01,340 INFO ]: Start accepts. Automaton has 8 states and 959 transitions. Word has length 6 [2018-06-26 20:48:01,340 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:01,340 INFO ]: Abstraction has 8 states and 959 transitions. [2018-06-26 20:48:01,340 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:01,340 INFO ]: Start isEmpty. Operand 8 states and 959 transitions. [2018-06-26 20:48:01,341 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:48:01,341 INFO ]: Found error trace [2018-06-26 20:48:01,341 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:48:01,341 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:01,341 INFO ]: Analyzing trace with hash 1920631819, now seen corresponding path program 1 times [2018-06-26 20:48:01,341 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:01,341 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:01,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:01,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:01,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:01,377 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:01,425 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:48:01,425 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:01,425 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:01,425 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:01,425 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:01,425 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:01,426 INFO ]: Start difference. First operand 8 states and 959 transitions. Second operand 3 states. [2018-06-26 20:48:04,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:04,371 INFO ]: Finished difference Result 9 states and 961 transitions. [2018-06-26 20:48:04,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:04,371 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:48:04,372 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:04,373 INFO ]: With dead ends: 9 [2018-06-26 20:48:04,373 INFO ]: Without dead ends: 9 [2018-06-26 20:48:04,373 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:04,373 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:48:04,380 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:48:04,380 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:48:04,382 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2018-06-26 20:48:04,382 INFO ]: Start accepts. Automaton has 9 states and 961 transitions. Word has length 6 [2018-06-26 20:48:04,382 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:04,383 INFO ]: Abstraction has 9 states and 961 transitions. [2018-06-26 20:48:04,383 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:04,383 INFO ]: Start isEmpty. Operand 9 states and 961 transitions. [2018-06-26 20:48:04,384 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:48:04,384 INFO ]: Found error trace [2018-06-26 20:48:04,385 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:04,385 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:04,385 INFO ]: Analyzing trace with hash -1112600055, now seen corresponding path program 1 times [2018-06-26 20:48:04,385 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:04,385 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:04,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:04,386 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:04,386 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:04,446 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:04,509 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:48:04,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:04,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:04,510 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:04,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:04,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:04,510 INFO ]: Start difference. First operand 9 states and 961 transitions. Second operand 3 states. [2018-06-26 20:48:07,369 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:07,369 INFO ]: Finished difference Result 11 states and 976 transitions. [2018-06-26 20:48:07,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:07,369 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:48:07,370 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:07,371 INFO ]: With dead ends: 11 [2018-06-26 20:48:07,371 INFO ]: Without dead ends: 11 [2018-06-26 20:48:07,371 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:07,371 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:48:07,376 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:48:07,376 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:48:07,378 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 976 transitions. [2018-06-26 20:48:07,378 INFO ]: Start accepts. Automaton has 11 states and 976 transitions. Word has length 8 [2018-06-26 20:48:07,378 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:07,378 INFO ]: Abstraction has 11 states and 976 transitions. [2018-06-26 20:48:07,378 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:07,378 INFO ]: Start isEmpty. Operand 11 states and 976 transitions. [2018-06-26 20:48:07,379 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:48:07,379 INFO ]: Found error trace [2018-06-26 20:48:07,379 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:07,379 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:07,379 INFO ]: Analyzing trace with hash -1841258124, now seen corresponding path program 1 times [2018-06-26 20:48:07,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:07,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:07,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:07,380 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:07,380 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:07,430 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:07,527 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:48:07,528 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:07,528 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:07,528 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:07,528 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:07,528 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:07,528 INFO ]: Start difference. First operand 11 states and 976 transitions. Second operand 3 states. [2018-06-26 20:48:09,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:09,695 INFO ]: Finished difference Result 13 states and 1028 transitions. [2018-06-26 20:48:09,710 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:09,710 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:48:09,710 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:09,711 INFO ]: With dead ends: 13 [2018-06-26 20:48:09,711 INFO ]: Without dead ends: 13 [2018-06-26 20:48:09,712 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:09,712 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:48:09,716 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:48:09,716 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:48:09,717 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1026 transitions. [2018-06-26 20:48:09,717 INFO ]: Start accepts. Automaton has 12 states and 1026 transitions. Word has length 8 [2018-06-26 20:48:09,717 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:09,717 INFO ]: Abstraction has 12 states and 1026 transitions. [2018-06-26 20:48:09,717 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:09,717 INFO ]: Start isEmpty. Operand 12 states and 1026 transitions. [2018-06-26 20:48:09,718 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:48:09,718 INFO ]: Found error trace [2018-06-26 20:48:09,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:09,718 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:09,718 INFO ]: Analyzing trace with hash -360882372, now seen corresponding path program 1 times [2018-06-26 20:48:09,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:09,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:09,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:09,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:09,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:09,760 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:09,864 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:48:09,864 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:09,864 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:09,864 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:09,864 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:09,864 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:09,864 INFO ]: Start difference. First operand 12 states and 1026 transitions. Second operand 3 states. [2018-06-26 20:48:11,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:11,990 INFO ]: Finished difference Result 14 states and 1158 transitions. [2018-06-26 20:48:11,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:11,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:48:11,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:11,992 INFO ]: With dead ends: 14 [2018-06-26 20:48:11,992 INFO ]: Without dead ends: 13 [2018-06-26 20:48:11,992 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:11,993 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:48:11,999 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:48:11,999 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:48:12,001 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1157 transitions. [2018-06-26 20:48:12,001 INFO ]: Start accepts. Automaton has 13 states and 1157 transitions. Word has length 9 [2018-06-26 20:48:12,001 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:12,002 INFO ]: Abstraction has 13 states and 1157 transitions. [2018-06-26 20:48:12,002 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:12,002 INFO ]: Start isEmpty. Operand 13 states and 1157 transitions. [2018-06-26 20:48:12,002 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:48:12,002 INFO ]: Found error trace [2018-06-26 20:48:12,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:12,002 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:12,003 INFO ]: Analyzing trace with hash -1706249802, now seen corresponding path program 1 times [2018-06-26 20:48:12,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:12,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:12,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:12,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:12,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:12,039 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:12,130 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:48:12,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:12,130 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:12,130 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:12,130 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:12,130 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:12,130 INFO ]: Start difference. First operand 13 states and 1157 transitions. Second operand 3 states. [2018-06-26 20:48:14,821 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:14,821 INFO ]: Finished difference Result 15 states and 1209 transitions. [2018-06-26 20:48:14,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:14,843 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:48:14,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:14,845 INFO ]: With dead ends: 15 [2018-06-26 20:48:14,845 INFO ]: Without dead ends: 15 [2018-06-26 20:48:14,845 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:14,845 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:48:14,850 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-06-26 20:48:14,850 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:48:14,851 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1157 transitions. [2018-06-26 20:48:14,851 INFO ]: Start accepts. Automaton has 13 states and 1157 transitions. Word has length 9 [2018-06-26 20:48:14,851 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:14,851 INFO ]: Abstraction has 13 states and 1157 transitions. [2018-06-26 20:48:14,851 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:14,851 INFO ]: Start isEmpty. Operand 13 states and 1157 transitions. [2018-06-26 20:48:14,852 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:48:14,852 INFO ]: Found error trace [2018-06-26 20:48:14,852 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:14,852 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:14,852 INFO ]: Analyzing trace with hash -1705326281, now seen corresponding path program 1 times [2018-06-26 20:48:14,852 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:14,852 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:14,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:14,853 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:14,853 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:14,879 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:14,963 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:48:14,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:14,963 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:14,963 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:14,963 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:14,963 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:14,964 INFO ]: Start difference. First operand 13 states and 1157 transitions. Second operand 3 states. [2018-06-26 20:48:17,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:17,068 INFO ]: Finished difference Result 15 states and 1245 transitions. [2018-06-26 20:48:17,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:17,069 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:48:17,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:17,070 INFO ]: With dead ends: 15 [2018-06-26 20:48:17,070 INFO ]: Without dead ends: 15 [2018-06-26 20:48:17,070 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:17,071 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:48:17,076 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 20:48:17,076 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:48:17,077 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1243 transitions. [2018-06-26 20:48:17,077 INFO ]: Start accepts. Automaton has 14 states and 1243 transitions. Word has length 9 [2018-06-26 20:48:17,077 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:17,077 INFO ]: Abstraction has 14 states and 1243 transitions. [2018-06-26 20:48:17,077 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:17,077 INFO ]: Start isEmpty. Operand 14 states and 1243 transitions. [2018-06-26 20:48:17,078 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:48:17,078 INFO ]: Found error trace [2018-06-26 20:48:17,078 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:17,078 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:17,078 INFO ]: Analyzing trace with hash 1821237864, now seen corresponding path program 1 times [2018-06-26 20:48:17,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:17,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:17,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:17,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:17,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:17,110 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:17,214 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:48:17,214 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:17,214 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:17,214 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:17,215 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:17,215 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:17,215 INFO ]: Start difference. First operand 14 states and 1243 transitions. Second operand 3 states. [2018-06-26 20:48:19,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:19,591 INFO ]: Finished difference Result 21 states and 1255 transitions. [2018-06-26 20:48:19,592 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:19,592 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:48:19,592 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:19,594 INFO ]: With dead ends: 21 [2018-06-26 20:48:19,594 INFO ]: Without dead ends: 21 [2018-06-26 20:48:19,594 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:19,594 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:48:19,601 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-26 20:48:19,601 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:48:19,603 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1251 transitions. [2018-06-26 20:48:19,603 INFO ]: Start accepts. Automaton has 19 states and 1251 transitions. Word has length 10 [2018-06-26 20:48:19,603 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:19,603 INFO ]: Abstraction has 19 states and 1251 transitions. [2018-06-26 20:48:19,603 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:19,603 INFO ]: Start isEmpty. Operand 19 states and 1251 transitions. [2018-06-26 20:48:19,604 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:48:19,604 INFO ]: Found error trace [2018-06-26 20:48:19,604 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:19,604 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:19,604 INFO ]: Analyzing trace with hash 1562386213, now seen corresponding path program 1 times [2018-06-26 20:48:19,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:19,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:19,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:19,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:19,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:19,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:19,727 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:48:19,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:19,727 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:19,727 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:19,727 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:19,727 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:19,727 INFO ]: Start difference. First operand 19 states and 1251 transitions. Second operand 3 states. [2018-06-26 20:48:21,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:21,968 INFO ]: Finished difference Result 23 states and 1463 transitions. [2018-06-26 20:48:21,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:21,969 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:48:21,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:21,971 INFO ]: With dead ends: 23 [2018-06-26 20:48:21,971 INFO ]: Without dead ends: 23 [2018-06-26 20:48:21,971 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:21,971 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 20:48:21,977 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-06-26 20:48:21,977 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:48:21,982 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1457 transitions. [2018-06-26 20:48:21,982 INFO ]: Start accepts. Automaton has 20 states and 1457 transitions. Word has length 10 [2018-06-26 20:48:21,982 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:21,982 INFO ]: Abstraction has 20 states and 1457 transitions. [2018-06-26 20:48:21,982 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:21,982 INFO ]: Start isEmpty. Operand 20 states and 1457 transitions. [2018-06-26 20:48:21,983 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:48:21,983 INFO ]: Found error trace [2018-06-26 20:48:21,983 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:21,983 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:21,983 INFO ]: Analyzing trace with hash 1567003818, now seen corresponding path program 1 times [2018-06-26 20:48:21,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:21,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:21,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:21,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:21,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:22,017 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:22,101 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:48:22,101 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:22,101 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:22,101 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:22,101 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:22,101 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:22,101 INFO ]: Start difference. First operand 20 states and 1457 transitions. Second operand 3 states. [2018-06-26 20:48:24,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:24,305 INFO ]: Finished difference Result 24 states and 1485 transitions. [2018-06-26 20:48:24,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:24,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:48:24,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:24,307 INFO ]: With dead ends: 24 [2018-06-26 20:48:24,308 INFO ]: Without dead ends: 22 [2018-06-26 20:48:24,308 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:24,308 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:48:24,313 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 20:48:24,314 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:48:24,318 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1482 transitions. [2018-06-26 20:48:24,318 INFO ]: Start accepts. Automaton has 21 states and 1482 transitions. Word has length 10 [2018-06-26 20:48:24,318 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:24,318 INFO ]: Abstraction has 21 states and 1482 transitions. [2018-06-26 20:48:24,318 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:24,318 INFO ]: Start isEmpty. Operand 21 states and 1482 transitions. [2018-06-26 20:48:24,319 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:48:24,319 INFO ]: Found error trace [2018-06-26 20:48:24,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:24,319 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:24,319 INFO ]: Analyzing trace with hash 1137566553, now seen corresponding path program 1 times [2018-06-26 20:48:24,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:24,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:24,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:24,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:24,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:24,363 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:24,449 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:48:24,450 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:24,450 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:24,450 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:24,450 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:24,450 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:24,450 INFO ]: Start difference. First operand 21 states and 1482 transitions. Second operand 3 states. [2018-06-26 20:48:26,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:26,498 INFO ]: Finished difference Result 25 states and 1770 transitions. [2018-06-26 20:48:26,498 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:26,499 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:48:26,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:26,500 INFO ]: With dead ends: 25 [2018-06-26 20:48:26,500 INFO ]: Without dead ends: 25 [2018-06-26 20:48:26,500 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:26,500 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 20:48:26,506 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-06-26 20:48:26,506 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 20:48:26,507 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1764 transitions. [2018-06-26 20:48:26,507 INFO ]: Start accepts. Automaton has 22 states and 1764 transitions. Word has length 10 [2018-06-26 20:48:26,507 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:26,507 INFO ]: Abstraction has 22 states and 1764 transitions. [2018-06-26 20:48:26,507 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:26,507 INFO ]: Start isEmpty. Operand 22 states and 1764 transitions. [2018-06-26 20:48:26,508 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:26,508 INFO ]: Found error trace [2018-06-26 20:48:26,508 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:26,508 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:26,508 INFO ]: Analyzing trace with hash 344185222, now seen corresponding path program 1 times [2018-06-26 20:48:26,508 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:26,508 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:26,508 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:26,509 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:26,509 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:26,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:26,764 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:48:26,765 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:48:26,765 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:26,765 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:26,765 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:26,765 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:26,765 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:26,765 INFO ]: Start difference. First operand 22 states and 1764 transitions. Second operand 3 states. [2018-06-26 20:48:29,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:29,086 INFO ]: Finished difference Result 26 states and 1980 transitions. [2018-06-26 20:48:29,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:29,087 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:29,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:29,089 INFO ]: With dead ends: 26 [2018-06-26 20:48:29,089 INFO ]: Without dead ends: 26 [2018-06-26 20:48:29,089 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:29,090 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 20:48:29,095 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-06-26 20:48:29,095 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 20:48:29,100 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1974 transitions. [2018-06-26 20:48:29,100 INFO ]: Start accepts. Automaton has 23 states and 1974 transitions. Word has length 11 [2018-06-26 20:48:29,100 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:29,100 INFO ]: Abstraction has 23 states and 1974 transitions. [2018-06-26 20:48:29,100 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:29,100 INFO ]: Start isEmpty. Operand 23 states and 1974 transitions. [2018-06-26 20:48:29,101 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:29,101 INFO ]: Found error trace [2018-06-26 20:48:29,101 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:29,101 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:29,101 INFO ]: Analyzing trace with hash -253075895, now seen corresponding path program 1 times [2018-06-26 20:48:29,101 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:29,101 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:29,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:29,102 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:29,102 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:29,135 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:29,232 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:48:29,232 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:29,232 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:29,232 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:29,233 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:29,233 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:29,233 INFO ]: Start difference. First operand 23 states and 1974 transitions. Second operand 3 states. [2018-06-26 20:48:31,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:31,545 INFO ]: Finished difference Result 39 states and 3012 transitions. [2018-06-26 20:48:31,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:31,566 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:31,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:31,569 INFO ]: With dead ends: 39 [2018-06-26 20:48:31,569 INFO ]: Without dead ends: 39 [2018-06-26 20:48:31,569 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:31,569 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 20:48:31,575 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-06-26 20:48:31,575 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 20:48:31,580 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3004 transitions. [2018-06-26 20:48:31,580 INFO ]: Start accepts. Automaton has 34 states and 3004 transitions. Word has length 11 [2018-06-26 20:48:31,580 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:31,580 INFO ]: Abstraction has 34 states and 3004 transitions. [2018-06-26 20:48:31,580 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:31,580 INFO ]: Start isEmpty. Operand 34 states and 3004 transitions. [2018-06-26 20:48:31,581 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:31,581 INFO ]: Found error trace [2018-06-26 20:48:31,581 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:31,581 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:31,581 INFO ]: Analyzing trace with hash 244701924, now seen corresponding path program 1 times [2018-06-26 20:48:31,582 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:31,582 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:31,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:31,582 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:31,582 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:31,616 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:31,702 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:48:31,702 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:31,702 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:31,702 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:31,702 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:31,702 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:31,702 INFO ]: Start difference. First operand 34 states and 3004 transitions. Second operand 3 states. [2018-06-26 20:48:33,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:33,859 INFO ]: Finished difference Result 45 states and 3930 transitions. [2018-06-26 20:48:33,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:33,865 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:33,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:33,869 INFO ]: With dead ends: 45 [2018-06-26 20:48:33,869 INFO ]: Without dead ends: 45 [2018-06-26 20:48:33,870 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:33,870 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 20:48:33,883 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-06-26 20:48:33,883 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-26 20:48:33,888 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3930 transitions. [2018-06-26 20:48:33,888 INFO ]: Start accepts. Automaton has 45 states and 3930 transitions. Word has length 11 [2018-06-26 20:48:33,888 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:33,888 INFO ]: Abstraction has 45 states and 3930 transitions. [2018-06-26 20:48:33,888 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:33,888 INFO ]: Start isEmpty. Operand 45 states and 3930 transitions. [2018-06-26 20:48:33,891 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:33,891 INFO ]: Found error trace [2018-06-26 20:48:33,891 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:33,891 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:33,891 INFO ]: Analyzing trace with hash -16654519, now seen corresponding path program 1 times [2018-06-26 20:48:33,891 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:33,891 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:33,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:33,892 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:33,892 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:33,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:34,013 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 20:48:34,013 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:34,013 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:34,013 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:34,013 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:34,013 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:34,013 INFO ]: Start difference. First operand 45 states and 3930 transitions. Second operand 3 states. [2018-06-26 20:48:36,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:36,851 INFO ]: Finished difference Result 72 states and 5220 transitions. [2018-06-26 20:48:36,874 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:36,874 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:36,874 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:36,878 INFO ]: With dead ends: 72 [2018-06-26 20:48:36,878 INFO ]: Without dead ends: 72 [2018-06-26 20:48:36,879 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:36,879 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 20:48:36,891 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-06-26 20:48:36,891 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 20:48:36,897 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 5212 transitions. [2018-06-26 20:48:36,897 INFO ]: Start accepts. Automaton has 67 states and 5212 transitions. Word has length 11 [2018-06-26 20:48:36,897 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:36,897 INFO ]: Abstraction has 67 states and 5212 transitions. [2018-06-26 20:48:36,897 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:36,897 INFO ]: Start isEmpty. Operand 67 states and 5212 transitions. [2018-06-26 20:48:36,899 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:36,899 INFO ]: Found error trace [2018-06-26 20:48:36,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:36,899 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:36,899 INFO ]: Analyzing trace with hash 471560389, now seen corresponding path program 1 times [2018-06-26 20:48:36,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:36,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:36,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:36,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:36,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:36,927 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:37,007 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:48:37,007 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:37,007 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:37,007 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:37,007 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:37,007 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:37,008 INFO ]: Start difference. First operand 67 states and 5212 transitions. Second operand 3 states. [2018-06-26 20:48:39,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:39,340 INFO ]: Finished difference Result 127 states and 9883 transitions. [2018-06-26 20:48:39,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:39,341 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:39,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:39,347 INFO ]: With dead ends: 127 [2018-06-26 20:48:39,347 INFO ]: Without dead ends: 127 [2018-06-26 20:48:39,347 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:39,347 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 20:48:39,363 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 72. [2018-06-26 20:48:39,363 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-26 20:48:39,366 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 6047 transitions. [2018-06-26 20:48:39,366 INFO ]: Start accepts. Automaton has 72 states and 6047 transitions. Word has length 11 [2018-06-26 20:48:39,367 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:39,367 INFO ]: Abstraction has 72 states and 6047 transitions. [2018-06-26 20:48:39,367 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:39,367 INFO ]: Start isEmpty. Operand 72 states and 6047 transitions. [2018-06-26 20:48:39,369 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:39,369 INFO ]: Found error trace [2018-06-26 20:48:39,369 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:39,369 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:39,369 INFO ]: Analyzing trace with hash -150892765, now seen corresponding path program 1 times [2018-06-26 20:48:39,369 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:39,369 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:39,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:39,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:39,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:39,390 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:39,474 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:48:39,474 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:39,474 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:39,474 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:39,474 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:39,474 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:39,474 INFO ]: Start difference. First operand 72 states and 6047 transitions. Second operand 3 states. [2018-06-26 20:48:41,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:41,899 INFO ]: Finished difference Result 132 states and 10705 transitions. [2018-06-26 20:48:41,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:41,899 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:41,900 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:41,907 INFO ]: With dead ends: 132 [2018-06-26 20:48:41,907 INFO ]: Without dead ends: 132 [2018-06-26 20:48:41,907 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:41,907 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-26 20:48:41,927 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 77. [2018-06-26 20:48:41,927 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-26 20:48:41,932 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 7430 transitions. [2018-06-26 20:48:41,933 INFO ]: Start accepts. Automaton has 77 states and 7430 transitions. Word has length 11 [2018-06-26 20:48:41,933 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:41,933 INFO ]: Abstraction has 77 states and 7430 transitions. [2018-06-26 20:48:41,933 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:41,933 INFO ]: Start isEmpty. Operand 77 states and 7430 transitions. [2018-06-26 20:48:41,937 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:41,937 INFO ]: Found error trace [2018-06-26 20:48:41,938 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:41,938 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:41,938 INFO ]: Analyzing trace with hash -474390886, now seen corresponding path program 1 times [2018-06-26 20:48:41,938 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:41,938 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:41,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:41,938 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:41,938 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:41,956 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:42,039 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:48:42,040 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:42,040 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:42,040 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:42,040 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:42,040 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:42,040 INFO ]: Start difference. First operand 77 states and 7430 transitions. Second operand 3 states. [2018-06-26 20:48:44,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:44,721 INFO ]: Finished difference Result 137 states and 11632 transitions. [2018-06-26 20:48:44,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:44,721 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:44,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:44,733 INFO ]: With dead ends: 137 [2018-06-26 20:48:44,733 INFO ]: Without dead ends: 137 [2018-06-26 20:48:44,739 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:44,739 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-26 20:48:44,764 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-06-26 20:48:44,765 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-26 20:48:44,772 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 11609 transitions. [2018-06-26 20:48:44,772 INFO ]: Start accepts. Automaton has 122 states and 11609 transitions. Word has length 11 [2018-06-26 20:48:44,773 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:44,773 INFO ]: Abstraction has 122 states and 11609 transitions. [2018-06-26 20:48:44,773 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:44,773 INFO ]: Start isEmpty. Operand 122 states and 11609 transitions. [2018-06-26 20:48:44,776 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:48:44,776 INFO ]: Found error trace [2018-06-26 20:48:44,776 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:44,776 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:44,777 INFO ]: Analyzing trace with hash 1775927626, now seen corresponding path program 1 times [2018-06-26 20:48:44,777 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:44,777 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:44,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:44,777 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:44,777 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:44,800 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:44,875 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:48:44,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:44,875 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:44,875 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:44,875 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:44,876 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:44,876 INFO ]: Start difference. First operand 122 states and 11609 transitions. Second operand 3 states. [2018-06-26 20:48:47,147 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:47,147 INFO ]: Finished difference Result 222 states and 19790 transitions. [2018-06-26 20:48:47,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:47,166 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:48:47,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:47,186 INFO ]: With dead ends: 222 [2018-06-26 20:48:47,186 INFO ]: Without dead ends: 222 [2018-06-26 20:48:47,186 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:47,187 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-26 20:48:47,221 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 207. [2018-06-26 20:48:47,221 INFO ]: Start removeUnreachable. Operand 207 states. [2018-06-26 20:48:47,233 INFO ]: Finished removeUnreachable. Reduced from 207 states to 207 states and 19767 transitions. [2018-06-26 20:48:47,233 INFO ]: Start accepts. Automaton has 207 states and 19767 transitions. Word has length 11 [2018-06-26 20:48:47,233 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:47,233 INFO ]: Abstraction has 207 states and 19767 transitions. [2018-06-26 20:48:47,233 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:47,233 INFO ]: Start isEmpty. Operand 207 states and 19767 transitions. [2018-06-26 20:48:47,238 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:48:47,238 INFO ]: Found error trace [2018-06-26 20:48:47,238 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:47,238 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:47,239 INFO ]: Analyzing trace with hash -433734795, now seen corresponding path program 1 times [2018-06-26 20:48:47,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:47,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:47,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:47,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:47,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:47,261 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:47,355 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:48:47,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:47,356 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:47,356 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:47,356 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:47,356 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:47,356 INFO ]: Start difference. First operand 207 states and 19767 transitions. Second operand 3 states. [2018-06-26 20:48:49,431 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:49,431 INFO ]: Finished difference Result 224 states and 18393 transitions. [2018-06-26 20:48:49,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:49,432 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:48:49,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:49,443 INFO ]: With dead ends: 224 [2018-06-26 20:48:49,443 INFO ]: Without dead ends: 224 [2018-06-26 20:48:49,443 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:49,444 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-26 20:48:49,478 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 219. [2018-06-26 20:48:49,478 INFO ]: Start removeUnreachable. Operand 219 states. [2018-06-26 20:48:49,491 INFO ]: Finished removeUnreachable. Reduced from 219 states to 219 states and 18385 transitions. [2018-06-26 20:48:49,491 INFO ]: Start accepts. Automaton has 219 states and 18385 transitions. Word has length 12 [2018-06-26 20:48:49,491 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:49,491 INFO ]: Abstraction has 219 states and 18385 transitions. [2018-06-26 20:48:49,491 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:49,491 INFO ]: Start isEmpty. Operand 219 states and 18385 transitions. [2018-06-26 20:48:49,495 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:48:49,495 INFO ]: Found error trace [2018-06-26 20:48:49,495 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:49,495 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:49,495 INFO ]: Analyzing trace with hash 488799580, now seen corresponding path program 1 times [2018-06-26 20:48:49,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:49,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:49,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:49,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:49,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:49,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:49,618 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:48:49,618 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:48:49,618 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:48:49,618 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:48:49,618 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:48:49,618 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:49,618 INFO ]: Start difference. First operand 219 states and 18385 transitions. Second operand 3 states. [2018-06-26 20:48:52,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:48:52,707 INFO ]: Finished difference Result 240 states and 16654 transitions. [2018-06-26 20:48:52,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:48:52,708 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:48:52,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:48:52,718 INFO ]: With dead ends: 240 [2018-06-26 20:48:52,718 INFO ]: Without dead ends: 240 [2018-06-26 20:48:52,718 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:48:52,718 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-26 20:48:52,749 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-06-26 20:48:52,749 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-26 20:48:52,760 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 16519 transitions. [2018-06-26 20:48:52,761 INFO ]: Start accepts. Automaton has 217 states and 16519 transitions. Word has length 12 [2018-06-26 20:48:52,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:48:52,761 INFO ]: Abstraction has 217 states and 16519 transitions. [2018-06-26 20:48:52,761 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:48:52,761 INFO ]: Start isEmpty. Operand 217 states and 16519 transitions. [2018-06-26 20:48:52,764 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:48:52,764 INFO ]: Found error trace [2018-06-26 20:48:52,764 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:48:52,764 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:48:52,765 INFO ]: Analyzing trace with hash 768639099, now seen corresponding path program 1 times [2018-06-26 20:48:52,765 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:48:52,765 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:48:52,766 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:52,766 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:52,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:48:52,793 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:53,001 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:48:53,065 INFO ]: Checked inductivity of 45 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:48:53,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:48:53,065 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:48:53,075 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:48:53,365 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:48:53,383 INFO ]: Computing forward predicates... [2018-06-26 20:48:53,552 INFO ]: Checked inductivity of 45 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:48:53,573 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:48:53,573 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:48:53,574 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:48:53,574 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:48:53,574 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:48:53,574 INFO ]: Start difference. First operand 217 states and 16519 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 20:48:55,389 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 20:48:55,389 WARN ]: Verification canceled [2018-06-26 20:48:55,392 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:48:55,394 WARN ]: Timeout [2018-06-26 20:48:55,394 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:48:55 BasicIcfg [2018-06-26 20:48:55,394 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:48:55,395 INFO ]: Toolchain (without parser) took 65828.60 ms. Allocated memory was 304.6 MB in the beginning and 1.3 GB in the end (delta: 962.1 MB). Free memory was 239.0 MB in the beginning and 211.3 MB in the end (delta: 27.7 MB). Peak memory consumption was 989.8 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,396 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:48:55,396 INFO ]: ChcToBoogie took 128.04 ms. Allocated memory is still 304.6 MB. Free memory was 238.0 MB in the beginning and 235.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,396 INFO ]: Boogie Preprocessor took 84.84 ms. Allocated memory is still 304.6 MB. Free memory was 235.0 MB in the beginning and 233.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,397 INFO ]: RCFGBuilder took 422.30 ms. Allocated memory is still 304.6 MB. Free memory was 233.0 MB in the beginning and 201.0 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,397 INFO ]: BlockEncodingV2 took 2227.49 ms. Allocated memory was 304.6 MB in the beginning and 391.6 MB in the end (delta: 87.0 MB). Free memory was 201.0 MB in the beginning and 250.3 MB in the end (delta: -49.3 MB). Peak memory consumption was 128.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,397 INFO ]: TraceAbstraction took 62946.98 ms. Allocated memory was 391.6 MB in the beginning and 1.3 GB in the end (delta: 875.0 MB). Free memory was 250.3 MB in the beginning and 211.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 914.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:48:55,402 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, 868 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 128.04 ms. Allocated memory is still 304.6 MB. Free memory was 238.0 MB in the beginning and 235.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 84.84 ms. Allocated memory is still 304.6 MB. Free memory was 235.0 MB in the beginning and 233.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 422.30 ms. Allocated memory is still 304.6 MB. Free memory was 233.0 MB in the beginning and 201.0 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2227.49 ms. Allocated memory was 304.6 MB in the beginning and 391.6 MB in the end (delta: 87.0 MB). Free memory was 201.0 MB in the beginning and 250.3 MB in the end (delta: -49.3 MB). Peak memory consumption was 128.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62946.98 ms. Allocated memory was 391.6 MB in the beginning and 1.3 GB in the end (delta: 875.0 MB). Free memory was 250.3 MB in the beginning and 211.3 MB in the end (delta: 39.1 MB). Peak memory consumption was 914.1 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 (217states) and interpolant automaton (currently 5 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 62.8s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 58.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 0 SDslu, 87 SDs, 0 SdLazy, 18162 SolverSat, 14027 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=21, 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 194 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2129 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 416/418 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_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-48-55-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-48-55-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-48-55-418.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-48-55-418.csv Completed graceful shutdown