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_8.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:49:33,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:49:33,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:49:33,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:49:33,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:49:33,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:49:33,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:49:33,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:49:33,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:49:33,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:49:33,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:49:33,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:49:33,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:49:33,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:49:33,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:49:33,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:49:33,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:49:33,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:49:33,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:49:33,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:49:33,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:49:33,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:49:33,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:49:33,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:49:33,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:49:33,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:49:33,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:49:33,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:49:33,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:49:33,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:49:33,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:49:33,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:49:33,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:49:33,858 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:49:33,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:49:33,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:49:33,861 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:49:33,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:49:33,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:49:33,883 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:49:33,884 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:49:33,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:49:33,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:49:33,889 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:49:33,889 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:49:33,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:49:33,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:49:33,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:49:33,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:49:33,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:49:33,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:49:33,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:49:33,892 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:49:33,894 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:49:33,895 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:49:33,943 INFO ]: Repository-Root is: /tmp [2018-06-26 20:49:33,960 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:49:33,966 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:49:33,967 INFO ]: Initializing SmtParser... [2018-06-26 20:49:33,968 INFO ]: SmtParser initialized [2018-06-26 20:49:33,969 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 [2018-06-26 20:49:33,970 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:49:34,059 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 unknown [2018-06-26 20:49:34,604 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_8.cil.smt2 [2018-06-26 20:49:34,609 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:49:34,627 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:49:34,627 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:49:34,627 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:49:34,627 INFO ]: ChcToBoogie initialized [2018-06-26 20:49:34,633 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,718 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34 Unit [2018-06-26 20:49:34,718 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:49:34,719 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:49:34,719 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:49:34,719 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:49:34,769 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,769 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,783 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,783 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,800 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,801 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,806 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... [2018-06-26 20:49:34,812 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:49:34,812 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:49:34,812 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:49:34,813 INFO ]: RCFGBuilder initialized [2018-06-26 20:49:34,813 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:49:34,831 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:49:34,831 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:49:34,831 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:49:34,831 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:49:34,831 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:49:34,831 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 20:49:35,273 INFO ]: Using library mode [2018-06-26 20:49:35,273 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:35 BoogieIcfgContainer [2018-06-26 20:49:35,273 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:49:35,274 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:49:35,274 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:49:35,275 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:49:35,276 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:35" (1/1) ... [2018-06-26 20:49:35,296 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:49:35,298 INFO ]: Using Remove infeasible edges [2018-06-26 20:49:35,298 INFO ]: Using Maximize final states [2018-06-26 20:49:35,299 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:49:35,299 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:49:35,306 INFO ]: Using Remove sink states [2018-06-26 20:49:35,307 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:49:35,307 INFO ]: Using Use SBE [2018-06-26 20:49:36,945 INFO ]: SBE split 1 edges [2018-06-26 20:49:37,063 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:49:37,066 INFO ]: 0 new accepting states [2018-06-26 20:49:37,122 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:49:37,127 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:49:37,288 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:49:37,288 INFO ]: 0 new accepting states [2018-06-26 20:49:37,289 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:49:37,290 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:49:37,449 INFO ]: Encoded RCFG 6 locations, 1044 edges [2018-06-26 20:49:37,449 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:49:37 BasicIcfg [2018-06-26 20:49:37,449 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:49:37,450 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:49:37,450 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:49:37,453 INFO ]: TraceAbstraction initialized [2018-06-26 20:49:37,453 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:49:34" (1/4) ... [2018-06-26 20:49:37,457 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b51c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:49:37, skipping insertion in model container [2018-06-26 20:49:37,457 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:49:34" (2/4) ... [2018-06-26 20:49:37,457 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b51c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:49:37, skipping insertion in model container [2018-06-26 20:49:37,458 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:49:35" (3/4) ... [2018-06-26 20:49:37,458 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b51c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:49:37, skipping insertion in model container [2018-06-26 20:49:37,458 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:49:37" (4/4) ... [2018-06-26 20:49:37,459 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:49:37,471 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:49:37,479 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:49:37,540 INFO ]: Using default assertion order modulation [2018-06-26 20:49:37,541 INFO ]: Interprodecural is true [2018-06-26 20:49:37,541 INFO ]: Hoare is false [2018-06-26 20:49:37,541 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:49:37,541 INFO ]: Backedges is TWOTRACK [2018-06-26 20:49:37,541 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:49:37,541 INFO ]: Difference is false [2018-06-26 20:49:37,541 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:49:37,541 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:49:37,562 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:49:37,590 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:49:37,590 INFO ]: Found error trace [2018-06-26 20:49:37,590 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:49:37,591 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:37,595 INFO ]: Analyzing trace with hash 67353890, now seen corresponding path program 1 times [2018-06-26 20:49:37,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:37,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:37,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:37,635 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:37,635 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:37,703 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:37,811 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:49:37,813 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:37,813 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:37,814 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:37,824 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:37,825 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:37,826 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:49:44,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:44,900 INFO ]: Finished difference Result 7 states and 1221 transitions. [2018-06-26 20:49:44,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:44,901 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:49:44,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:44,914 INFO ]: With dead ends: 7 [2018-06-26 20:49:44,914 INFO ]: Without dead ends: 7 [2018-06-26 20:49:44,916 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:49:44,933 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:49:44,966 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:49:44,967 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:49:44,968 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2018-06-26 20:49:44,970 INFO ]: Start accepts. Automaton has 7 states and 1221 transitions. Word has length 5 [2018-06-26 20:49:44,970 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:44,970 INFO ]: Abstraction has 7 states and 1221 transitions. [2018-06-26 20:49:44,970 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:44,971 INFO ]: Start isEmpty. Operand 7 states and 1221 transitions. [2018-06-26 20:49:44,971 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:49:44,971 INFO ]: Found error trace [2018-06-26 20:49:44,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:49:44,972 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:44,972 INFO ]: Analyzing trace with hash 2070709267, now seen corresponding path program 1 times [2018-06-26 20:49:44,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:44,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:44,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:44,973 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:44,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:45,017 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:45,070 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:49:45,070 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:45,070 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:45,072 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:45,072 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:45,072 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:45,072 INFO ]: Start difference. First operand 7 states and 1221 transitions. Second operand 3 states. [2018-06-26 20:49:48,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:48,138 INFO ]: Finished difference Result 8 states and 1223 transitions. [2018-06-26 20:49:48,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:48,173 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:49:48,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:48,175 INFO ]: With dead ends: 8 [2018-06-26 20:49:48,175 INFO ]: Without dead ends: 8 [2018-06-26 20:49:48,176 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:49:48,176 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:49:48,184 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:49:48,184 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:49:48,186 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1223 transitions. [2018-06-26 20:49:48,186 INFO ]: Start accepts. Automaton has 8 states and 1223 transitions. Word has length 6 [2018-06-26 20:49:48,186 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:48,186 INFO ]: Abstraction has 8 states and 1223 transitions. [2018-06-26 20:49:48,186 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:48,186 INFO ]: Start isEmpty. Operand 8 states and 1223 transitions. [2018-06-26 20:49:48,187 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:49:48,187 INFO ]: Found error trace [2018-06-26 20:49:48,187 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:49:48,187 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:48,187 INFO ]: Analyzing trace with hash 2072377563, now seen corresponding path program 1 times [2018-06-26 20:49:48,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:48,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:48,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:48,188 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:48,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:48,218 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:48,296 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:49:48,297 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:48,297 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:48,297 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:48,297 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:48,297 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:48,297 INFO ]: Start difference. First operand 8 states and 1223 transitions. Second operand 3 states. [2018-06-26 20:49:51,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:51,873 INFO ]: Finished difference Result 9 states and 1225 transitions. [2018-06-26 20:49:51,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:51,875 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:49:51,875 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:51,877 INFO ]: With dead ends: 9 [2018-06-26 20:49:51,877 INFO ]: Without dead ends: 9 [2018-06-26 20:49:51,877 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:51,877 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:49:51,918 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:49:51,918 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:49:51,920 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1225 transitions. [2018-06-26 20:49:51,920 INFO ]: Start accepts. Automaton has 9 states and 1225 transitions. Word has length 6 [2018-06-26 20:49:51,920 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:51,920 INFO ]: Abstraction has 9 states and 1225 transitions. [2018-06-26 20:49:51,920 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:51,920 INFO ]: Start isEmpty. Operand 9 states and 1225 transitions. [2018-06-26 20:49:51,921 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:49:51,921 INFO ]: Found error trace [2018-06-26 20:49:51,921 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:51,921 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:51,922 INFO ]: Analyzing trace with hash 624184795, now seen corresponding path program 1 times [2018-06-26 20:49:51,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:51,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:51,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:51,923 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:51,923 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:51,989 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:52,090 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:49:52,090 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:52,091 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:52,091 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:52,091 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:52,091 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:52,091 INFO ]: Start difference. First operand 9 states and 1225 transitions. Second operand 3 states. [2018-06-26 20:49:55,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:55,220 INFO ]: Finished difference Result 11 states and 1348 transitions. [2018-06-26 20:49:55,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:55,221 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:49:55,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:55,223 INFO ]: With dead ends: 11 [2018-06-26 20:49:55,223 INFO ]: Without dead ends: 11 [2018-06-26 20:49:55,223 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:49:55,223 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:49:55,229 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:49:55,229 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:49:55,232 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1348 transitions. [2018-06-26 20:49:55,232 INFO ]: Start accepts. Automaton has 11 states and 1348 transitions. Word has length 8 [2018-06-26 20:49:55,232 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:55,232 INFO ]: Abstraction has 11 states and 1348 transitions. [2018-06-26 20:49:55,232 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:55,232 INFO ]: Start isEmpty. Operand 11 states and 1348 transitions. [2018-06-26 20:49:55,233 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:49:55,233 INFO ]: Found error trace [2018-06-26 20:49:55,233 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:55,233 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:55,233 INFO ]: Analyzing trace with hash 913246868, now seen corresponding path program 1 times [2018-06-26 20:49:55,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:55,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:55,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:55,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:55,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:55,271 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:55,355 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:49:55,355 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:55,355 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:55,355 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:55,355 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:55,355 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:55,355 INFO ]: Start difference. First operand 11 states and 1348 transitions. Second operand 3 states. [2018-06-26 20:49:58,067 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:49:58,067 INFO ]: Finished difference Result 13 states and 1484 transitions. [2018-06-26 20:49:58,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:49:58,067 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:49:58,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:49:58,070 INFO ]: With dead ends: 13 [2018-06-26 20:49:58,070 INFO ]: Without dead ends: 13 [2018-06-26 20:49:58,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:49:58,070 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:49:58,075 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:49:58,076 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:49:58,078 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1482 transitions. [2018-06-26 20:49:58,078 INFO ]: Start accepts. Automaton has 12 states and 1482 transitions. Word has length 8 [2018-06-26 20:49:58,078 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:49:58,078 INFO ]: Abstraction has 12 states and 1482 transitions. [2018-06-26 20:49:58,078 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:49:58,078 INFO ]: Start isEmpty. Operand 12 states and 1482 transitions. [2018-06-26 20:49:58,080 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:49:58,080 INFO ]: Found error trace [2018-06-26 20:49:58,080 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:49:58,080 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:49:58,080 INFO ]: Analyzing trace with hash -1886732587, now seen corresponding path program 1 times [2018-06-26 20:49:58,080 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:49:58,080 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:49:58,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:58,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:49:58,081 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:49:58,119 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:49:58,220 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:49:58,220 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:49:58,246 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:49:58,246 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:49:58,246 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:49:58,246 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:49:58,246 INFO ]: Start difference. First operand 12 states and 1482 transitions. Second operand 3 states. [2018-06-26 20:50:01,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:01,233 INFO ]: Finished difference Result 17 states and 2300 transitions. [2018-06-26 20:50:01,233 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:01,233 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:01,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:01,236 INFO ]: With dead ends: 17 [2018-06-26 20:50:01,236 INFO ]: Without dead ends: 17 [2018-06-26 20:50:01,236 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:50:01,236 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:50:01,248 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-06-26 20:50:01,248 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:50:01,250 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2297 transitions. [2018-06-26 20:50:01,251 INFO ]: Start accepts. Automaton has 15 states and 2297 transitions. Word has length 9 [2018-06-26 20:50:01,251 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:01,251 INFO ]: Abstraction has 15 states and 2297 transitions. [2018-06-26 20:50:01,251 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:01,251 INFO ]: Start isEmpty. Operand 15 states and 2297 transitions. [2018-06-26 20:50:01,253 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:01,253 INFO ]: Found error trace [2018-06-26 20:50:01,253 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:01,253 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:01,253 INFO ]: Analyzing trace with hash -1649387690, now seen corresponding path program 1 times [2018-06-26 20:50:01,253 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:01,253 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:01,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:01,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:01,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:01,285 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:01,383 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:50:01,384 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:01,384 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:01,384 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:01,384 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:01,384 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:01,384 INFO ]: Start difference. First operand 15 states and 2297 transitions. Second operand 3 states. [2018-06-26 20:50:04,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:04,232 INFO ]: Finished difference Result 18 states and 2753 transitions. [2018-06-26 20:50:04,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:04,258 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:04,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:04,260 INFO ]: With dead ends: 18 [2018-06-26 20:50:04,261 INFO ]: Without dead ends: 17 [2018-06-26 20:50:04,261 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:50:04,261 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 20:50:04,272 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 20:50:04,272 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 20:50:04,274 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2751 transitions. [2018-06-26 20:50:04,274 INFO ]: Start accepts. Automaton has 17 states and 2751 transitions. Word has length 9 [2018-06-26 20:50:04,274 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:04,274 INFO ]: Abstraction has 17 states and 2751 transitions. [2018-06-26 20:50:04,274 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:04,274 INFO ]: Start isEmpty. Operand 17 states and 2751 transitions. [2018-06-26 20:50:04,276 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:04,276 INFO ]: Found error trace [2018-06-26 20:50:04,276 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:04,276 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:04,276 INFO ]: Analyzing trace with hash -1879344419, now seen corresponding path program 1 times [2018-06-26 20:50:04,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:04,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:04,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:04,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:04,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:04,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:04,526 WARN ]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:50:04,527 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:04,527 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:04,527 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:04,527 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:04,527 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:04,527 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:04,527 INFO ]: Start difference. First operand 17 states and 2751 transitions. Second operand 3 states. [2018-06-26 20:50:07,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:07,405 INFO ]: Finished difference Result 21 states and 2662 transitions. [2018-06-26 20:50:07,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:07,405 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:07,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:07,408 INFO ]: With dead ends: 21 [2018-06-26 20:50:07,408 INFO ]: Without dead ends: 21 [2018-06-26 20:50:07,408 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:50:07,408 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:50:07,418 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-26 20:50:07,418 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 20:50:07,420 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2659 transitions. [2018-06-26 20:50:07,421 INFO ]: Start accepts. Automaton has 19 states and 2659 transitions. Word has length 9 [2018-06-26 20:50:07,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:07,421 INFO ]: Abstraction has 19 states and 2659 transitions. [2018-06-26 20:50:07,421 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:07,421 INFO ]: Start isEmpty. Operand 19 states and 2659 transitions. [2018-06-26 20:50:07,423 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:07,423 INFO ]: Found error trace [2018-06-26 20:50:07,423 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:07,423 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:07,423 INFO ]: Analyzing trace with hash -1743852603, now seen corresponding path program 1 times [2018-06-26 20:50:07,423 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:07,423 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:07,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:07,424 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:07,424 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:07,452 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:07,531 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:50:07,531 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:07,531 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:07,531 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:07,531 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:07,531 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:07,531 INFO ]: Start difference. First operand 19 states and 2659 transitions. Second operand 3 states. [2018-06-26 20:50:10,865 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:10,866 INFO ]: Finished difference Result 22 states and 2833 transitions. [2018-06-26 20:50:10,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:10,866 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:10,866 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:10,869 INFO ]: With dead ends: 22 [2018-06-26 20:50:10,869 INFO ]: Without dead ends: 22 [2018-06-26 20:50:10,869 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:50:10,869 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 20:50:10,882 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 20:50:10,882 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 20:50:10,884 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2831 transitions. [2018-06-26 20:50:10,885 INFO ]: Start accepts. Automaton has 21 states and 2831 transitions. Word has length 9 [2018-06-26 20:50:10,885 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:10,885 INFO ]: Abstraction has 21 states and 2831 transitions. [2018-06-26 20:50:10,885 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:10,885 INFO ]: Start isEmpty. Operand 21 states and 2831 transitions. [2018-06-26 20:50:10,886 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:10,886 INFO ]: Found error trace [2018-06-26 20:50:10,886 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:10,886 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:10,887 INFO ]: Analyzing trace with hash 891697475, now seen corresponding path program 1 times [2018-06-26 20:50:10,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:10,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:10,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:10,890 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:10,890 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:10,919 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:11,023 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:11,023 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:50:11,023 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:50:11,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:11,235 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:11,250 INFO ]: Computing forward predicates... [2018-06-26 20:50:11,476 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:11,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:50:11,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:50:11,501 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:50:11,501 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:50:11,501 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:50:11,501 INFO ]: Start difference. First operand 21 states and 2831 transitions. Second operand 6 states. [2018-06-26 20:50:22,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:22,315 INFO ]: Finished difference Result 58 states and 9121 transitions. [2018-06-26 20:50:22,315 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 20:50:22,315 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 20:50:22,316 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:22,328 INFO ]: With dead ends: 58 [2018-06-26 20:50:22,328 INFO ]: Without dead ends: 58 [2018-06-26 20:50:22,328 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:50:22,328 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 20:50:22,360 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-06-26 20:50:22,361 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 20:50:22,369 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 7415 transitions. [2018-06-26 20:50:22,369 INFO ]: Start accepts. Automaton has 51 states and 7415 transitions. Word has length 10 [2018-06-26 20:50:22,370 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:22,370 INFO ]: Abstraction has 51 states and 7415 transitions. [2018-06-26 20:50:22,370 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:50:22,385 INFO ]: Start isEmpty. Operand 51 states and 7415 transitions. [2018-06-26 20:50:22,389 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:22,389 INFO ]: Found error trace [2018-06-26 20:50:22,389 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:22,389 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:22,389 INFO ]: Analyzing trace with hash 656408157, now seen corresponding path program 1 times [2018-06-26 20:50:22,389 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:22,389 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:22,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:22,392 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:22,392 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:22,426 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:22,515 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:50:22,515 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:22,516 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:22,516 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:22,516 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:22,516 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:22,516 INFO ]: Start difference. First operand 51 states and 7415 transitions. Second operand 3 states. [2018-06-26 20:50:25,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:25,449 INFO ]: Finished difference Result 95 states and 12062 transitions. [2018-06-26 20:50:25,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:25,451 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:25,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:25,460 INFO ]: With dead ends: 95 [2018-06-26 20:50:25,460 INFO ]: Without dead ends: 95 [2018-06-26 20:50:25,460 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:50:25,460 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-26 20:50:25,486 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-26 20:50:25,486 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-26 20:50:25,497 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 12062 transitions. [2018-06-26 20:50:25,497 INFO ]: Start accepts. Automaton has 95 states and 12062 transitions. Word has length 10 [2018-06-26 20:50:25,497 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:25,497 INFO ]: Abstraction has 95 states and 12062 transitions. [2018-06-26 20:50:25,497 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:25,497 INFO ]: Start isEmpty. Operand 95 states and 12062 transitions. [2018-06-26 20:50:25,502 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:25,502 INFO ]: Found error trace [2018-06-26 20:50:25,502 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:25,502 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:25,502 INFO ]: Analyzing trace with hash 9019936, now seen corresponding path program 1 times [2018-06-26 20:50:25,502 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:25,502 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:25,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:25,506 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:25,506 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:25,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:25,628 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:50:25,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:25,628 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:25,629 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:25,629 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:25,629 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:25,629 INFO ]: Start difference. First operand 95 states and 12062 transitions. Second operand 3 states. [2018-06-26 20:50:29,276 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:29,276 INFO ]: Finished difference Result 139 states and 16493 transitions. [2018-06-26 20:50:29,279 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:29,279 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:29,279 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:29,290 INFO ]: With dead ends: 139 [2018-06-26 20:50:29,290 INFO ]: Without dead ends: 139 [2018-06-26 20:50:29,290 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:50:29,290 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-26 20:50:29,320 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-06-26 20:50:29,320 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-26 20:50:29,335 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 16493 transitions. [2018-06-26 20:50:29,335 INFO ]: Start accepts. Automaton has 139 states and 16493 transitions. Word has length 10 [2018-06-26 20:50:29,335 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:29,335 INFO ]: Abstraction has 139 states and 16493 transitions. [2018-06-26 20:50:29,335 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:29,335 INFO ]: Start isEmpty. Operand 139 states and 16493 transitions. [2018-06-26 20:50:29,340 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:29,340 INFO ]: Found error trace [2018-06-26 20:50:29,340 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:29,340 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:29,340 INFO ]: Analyzing trace with hash 268529337, now seen corresponding path program 1 times [2018-06-26 20:50:29,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:29,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:29,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:29,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:29,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:29,364 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:29,520 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:50:29,520 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:29,520 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:29,520 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:29,520 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:29,520 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:29,520 INFO ]: Start difference. First operand 139 states and 16493 transitions. Second operand 3 states. [2018-06-26 20:50:32,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:32,369 INFO ]: Finished difference Result 68 states and 8377 transitions. [2018-06-26 20:50:32,369 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:32,369 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:32,369 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:32,376 INFO ]: With dead ends: 68 [2018-06-26 20:50:32,377 INFO ]: Without dead ends: 68 [2018-06-26 20:50:32,377 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:50:32,377 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 20:50:32,398 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-06-26 20:50:32,398 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 20:50:32,405 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 8198 transitions. [2018-06-26 20:50:32,406 INFO ]: Start accepts. Automaton has 61 states and 8198 transitions. Word has length 10 [2018-06-26 20:50:32,406 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:32,406 INFO ]: Abstraction has 61 states and 8198 transitions. [2018-06-26 20:50:32,406 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:32,406 INFO ]: Start isEmpty. Operand 61 states and 8198 transitions. [2018-06-26 20:50:32,411 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:32,411 INFO ]: Found error trace [2018-06-26 20:50:32,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:32,411 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:32,411 INFO ]: Analyzing trace with hash 653511386, now seen corresponding path program 1 times [2018-06-26 20:50:32,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:32,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:32,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:32,411 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:32,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:32,436 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:32,503 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:50:32,503 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:32,503 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:32,504 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:32,504 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:32,504 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:32,504 INFO ]: Start difference. First operand 61 states and 8198 transitions. Second operand 3 states. [2018-06-26 20:50:35,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:35,263 INFO ]: Finished difference Result 112 states and 15186 transitions. [2018-06-26 20:50:35,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:35,264 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:35,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:35,281 INFO ]: With dead ends: 112 [2018-06-26 20:50:35,281 INFO ]: Without dead ends: 112 [2018-06-26 20:50:35,281 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:50:35,281 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-26 20:50:35,311 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 103. [2018-06-26 20:50:35,311 INFO ]: Start removeUnreachable. Operand 103 states. [2018-06-26 20:50:35,321 INFO ]: Finished removeUnreachable. Reduced from 103 states to 103 states and 15146 transitions. [2018-06-26 20:50:35,321 INFO ]: Start accepts. Automaton has 103 states and 15146 transitions. Word has length 10 [2018-06-26 20:50:35,322 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:35,322 INFO ]: Abstraction has 103 states and 15146 transitions. [2018-06-26 20:50:35,322 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:35,322 INFO ]: Start isEmpty. Operand 103 states and 15146 transitions. [2018-06-26 20:50:35,326 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:35,326 INFO ]: Found error trace [2018-06-26 20:50:35,326 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:35,326 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:35,326 INFO ]: Analyzing trace with hash 886238678, now seen corresponding path program 1 times [2018-06-26 20:50:35,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:35,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:35,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:35,327 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:35,327 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:35,347 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:35,430 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:50:35,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:35,430 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:35,431 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:35,431 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:35,431 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:35,431 INFO ]: Start difference. First operand 103 states and 15146 transitions. Second operand 3 states. [2018-06-26 20:50:38,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:38,266 INFO ]: Finished difference Result 160 states and 22146 transitions. [2018-06-26 20:50:38,267 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:38,267 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:38,267 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:38,276 INFO ]: With dead ends: 160 [2018-06-26 20:50:38,276 INFO ]: Without dead ends: 160 [2018-06-26 20:50:38,276 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:50:38,276 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-26 20:50:38,300 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 151. [2018-06-26 20:50:38,300 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-26 20:50:38,309 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 22106 transitions. [2018-06-26 20:50:38,309 INFO ]: Start accepts. Automaton has 151 states and 22106 transitions. Word has length 10 [2018-06-26 20:50:38,309 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:38,309 INFO ]: Abstraction has 151 states and 22106 transitions. [2018-06-26 20:50:38,309 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:38,309 INFO ]: Start isEmpty. Operand 151 states and 22106 transitions. [2018-06-26 20:50:38,313 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:38,313 INFO ]: Found error trace [2018-06-26 20:50:38,313 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:38,313 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:38,313 INFO ]: Analyzing trace with hash -1694673642, now seen corresponding path program 1 times [2018-06-26 20:50:38,313 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:38,313 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:38,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:38,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:38,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:38,333 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:38,468 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:50:38,469 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:38,469 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:38,469 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:38,469 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:38,469 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:38,469 INFO ]: Start difference. First operand 151 states and 22106 transitions. Second operand 3 states. [2018-06-26 20:50:41,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:41,008 INFO ]: Finished difference Result 164 states and 19693 transitions. [2018-06-26 20:50:41,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:41,009 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:50:41,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:41,018 INFO ]: With dead ends: 164 [2018-06-26 20:50:41,018 INFO ]: Without dead ends: 164 [2018-06-26 20:50:41,019 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:50:41,019 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-26 20:50:41,040 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 70. [2018-06-26 20:50:41,040 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 20:50:41,045 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 7292 transitions. [2018-06-26 20:50:41,045 INFO ]: Start accepts. Automaton has 70 states and 7292 transitions. Word has length 10 [2018-06-26 20:50:41,045 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:41,045 INFO ]: Abstraction has 70 states and 7292 transitions. [2018-06-26 20:50:41,045 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:41,045 INFO ]: Start isEmpty. Operand 70 states and 7292 transitions. [2018-06-26 20:50:41,047 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:41,048 INFO ]: Found error trace [2018-06-26 20:50:41,048 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:41,048 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:41,048 INFO ]: Analyzing trace with hash -816471946, now seen corresponding path program 1 times [2018-06-26 20:50:41,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:41,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:41,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:41,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:41,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:41,066 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:41,320 WARN ]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:50:41,396 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:41,397 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:50:41,397 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:50:41,409 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:41,578 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:41,584 INFO ]: Computing forward predicates... [2018-06-26 20:50:41,603 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:41,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:50:41,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:50:41,624 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:50:41,625 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:50:41,625 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:50:41,625 INFO ]: Start difference. First operand 70 states and 7292 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 20:50:41,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 20:50:41,766 WARN ]: Verification canceled [2018-06-26 20:50:41,771 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:50:41,772 WARN ]: Timeout [2018-06-26 20:50:41,772 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:50:41 BasicIcfg [2018-06-26 20:50:41,772 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:50:41,775 INFO ]: Toolchain (without parser) took 67165.44 ms. Allocated memory was 296.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 229.2 MB in the beginning and 1.2 GB in the end (delta: -971.3 MB). Peak memory consumption was 204.7 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:41,775 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 296.7 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:50:41,776 INFO ]: ChcToBoogie took 91.14 ms. Allocated memory is still 296.7 MB. Free memory was 229.2 MB in the beginning and 225.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:41,776 INFO ]: Boogie Preprocessor took 93.16 ms. Allocated memory is still 296.7 MB. Free memory was 225.2 MB in the beginning and 223.2 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:50:41,776 INFO ]: RCFGBuilder took 460.78 ms. Allocated memory is still 296.7 MB. Free memory was 221.2 MB in the beginning and 189.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:41,777 INFO ]: BlockEncodingV2 took 2175.43 ms. Allocated memory was 296.7 MB in the beginning and 396.4 MB in the end (delta: 99.6 MB). Free memory was 189.3 MB in the beginning and 160.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 130.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:41,777 INFO ]: TraceAbstraction took 64322.23 ms. Allocated memory was 396.4 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 160.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 36.7 MB. Max. memory is 3.6 GB. [2018-06-26 20:50:41,785 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, 1044 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 296.7 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 91.14 ms. Allocated memory is still 296.7 MB. Free memory was 229.2 MB in the beginning and 225.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 93.16 ms. Allocated memory is still 296.7 MB. Free memory was 225.2 MB in the beginning and 223.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 460.78 ms. Allocated memory is still 296.7 MB. Free memory was 221.2 MB in the beginning and 189.3 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2175.43 ms. Allocated memory was 296.7 MB in the beginning and 396.4 MB in the end (delta: 99.6 MB). Free memory was 189.3 MB in the beginning and 160.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 130.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 64322.23 ms. Allocated memory was 396.4 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 160.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 36.7 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 (70states) and interpolant automaton (currently 5 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (17 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 64.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 60.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 0 SDslu, 72 SDs, 0 SdLazy, 16614 SolverSat, 18632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=15, 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, 16 MinimizatonAttempts, 132 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2425 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 200/204 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_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-50-41-808.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-50-41-808.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-50-41-808.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_8.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-50-41-808.csv Completed graceful shutdown