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/ctigar/ken-imp.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:33:36,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:33:36,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:33:36,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:33:36,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:33:36,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:33:36,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:33:36,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:33:36,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:33:36,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:33:36,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:33:36,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:33:36,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:33:36,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:33:36,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:33:36,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:33:36,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:33:36,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:33:36,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:33:36,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:33:36,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:33:36,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:33:36,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:33:36,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:33:36,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:33:36,883 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:33:36,884 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:33:36,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:33:36,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:33:36,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:33:36,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:33:36,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:33:36,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:33:36,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:33:36,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:33:36,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:33:36,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 21:33:36,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:33:36,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:33:36,913 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:33:36,913 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:33:36,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:33:36,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:33:36,914 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:33:36,915 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:33:36,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:33:36,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:33:36,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:33:36,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:33:36,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:33:36,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:33:36,916 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:33:36,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:33:36,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:33:36,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:33:36,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:33:36,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:33:36,918 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:33:36,919 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:33:36,920 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:33:36,970 INFO ]: Repository-Root is: /tmp [2018-06-26 21:33:36,987 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:33:36,994 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:33:36,995 INFO ]: Initializing SmtParser... [2018-06-26 21:33:36,996 INFO ]: SmtParser initialized [2018-06-26 21:33:36,997 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/ken-imp.c.smt2 [2018-06-26 21:33:36,999 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 21:33:37,083 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/ken-imp.c.smt2 unknown [2018-06-26 21:33:37,330 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/ken-imp.c.smt2 [2018-06-26 21:33:37,340 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:33:37,346 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:33:37,346 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:33:37,346 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:33:37,346 INFO ]: ChcToBoogie initialized [2018-06-26 21:33:37,350 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,405 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37 Unit [2018-06-26 21:33:37,406 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:33:37,406 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:33:37,406 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:33:37,406 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:33:37,428 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,428 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,435 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,435 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,449 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,450 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,452 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,453 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:33:37,454 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:33:37,454 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:33:37,454 INFO ]: RCFGBuilder initialized [2018-06-26 21:33:37,455 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (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 21:33:37,480 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:33:37,480 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:33:37,480 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:33:37,480 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:33:37,480 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:33:37,480 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 21:33:37,704 INFO ]: Using library mode [2018-06-26 21:33:37,704 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:37 BoogieIcfgContainer [2018-06-26 21:33:37,704 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:33:37,705 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:33:37,705 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:33:37,715 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:33:37,716 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:37" (1/1) ... [2018-06-26 21:33:37,739 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:33:37,740 INFO ]: Using Remove infeasible edges [2018-06-26 21:33:37,740 INFO ]: Using Maximize final states [2018-06-26 21:33:37,741 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:33:37,741 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:33:37,748 INFO ]: Using Remove sink states [2018-06-26 21:33:37,748 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:33:37,749 INFO ]: Using Use SBE [2018-06-26 21:33:37,758 WARN ]: expecting exponential blowup for input size 20 [2018-06-26 21:33:41,068 INFO ]: SBE split 1 edges [2018-06-26 21:33:41,078 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:33:41,079 INFO ]: 0 new accepting states [2018-06-26 21:33:41,111 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:33:41,112 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:33:41,120 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:33:41,121 INFO ]: 0 new accepting states [2018-06-26 21:33:41,121 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:33:41,121 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:33:41,128 INFO ]: Encoded RCFG 6 locations, 142 edges [2018-06-26 21:33:41,128 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:33:41 BasicIcfg [2018-06-26 21:33:41,128 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:33:41,129 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:33:41,129 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:33:41,132 INFO ]: TraceAbstraction initialized [2018-06-26 21:33:41,133 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:33:37" (1/4) ... [2018-06-26 21:33:41,133 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582ac4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:33:41, skipping insertion in model container [2018-06-26 21:33:41,133 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:33:37" (2/4) ... [2018-06-26 21:33:41,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582ac4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:33:41, skipping insertion in model container [2018-06-26 21:33:41,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:33:37" (3/4) ... [2018-06-26 21:33:41,134 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582ac4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:33:41, skipping insertion in model container [2018-06-26 21:33:41,134 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:33:41" (4/4) ... [2018-06-26 21:33:41,137 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:33:41,144 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:33:41,150 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:33:41,188 INFO ]: Using default assertion order modulation [2018-06-26 21:33:41,188 INFO ]: Interprodecural is true [2018-06-26 21:33:41,188 INFO ]: Hoare is false [2018-06-26 21:33:41,188 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:33:41,188 INFO ]: Backedges is TWOTRACK [2018-06-26 21:33:41,189 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:33:41,189 INFO ]: Difference is false [2018-06-26 21:33:41,189 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:33:41,189 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:33:41,203 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:33:41,216 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:33:41,216 INFO ]: Found error trace [2018-06-26 21:33:41,217 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:33:41,217 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:41,221 INFO ]: Analyzing trace with hash 39615586, now seen corresponding path program 1 times [2018-06-26 21:33:41,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:41,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:41,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:41,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:41,254 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:41,296 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:41,352 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:33:41,353 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:41,353 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:41,354 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:41,364 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:41,365 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:41,368 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:33:43,061 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:43,061 INFO ]: Finished difference Result 7 states and 194 transitions. [2018-06-26 21:33:43,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:43,062 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:33:43,062 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:43,072 INFO ]: With dead ends: 7 [2018-06-26 21:33:43,072 INFO ]: Without dead ends: 7 [2018-06-26 21:33:43,074 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 21:33:43,091 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:33:43,108 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:33:43,111 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:33:43,112 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2018-06-26 21:33:43,113 INFO ]: Start accepts. Automaton has 7 states and 194 transitions. Word has length 5 [2018-06-26 21:33:43,115 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:43,115 INFO ]: Abstraction has 7 states and 194 transitions. [2018-06-26 21:33:43,115 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:43,115 INFO ]: Start isEmpty. Operand 7 states and 194 transitions. [2018-06-26 21:33:43,116 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:33:43,116 INFO ]: Found error trace [2018-06-26 21:33:43,116 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:33:43,116 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:43,116 INFO ]: Analyzing trace with hash 1224969685, now seen corresponding path program 1 times [2018-06-26 21:33:43,116 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:43,116 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:43,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:43,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:43,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:43,126 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:43,157 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 21:33:43,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:43,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:43,159 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:43,159 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:43,159 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:43,159 INFO ]: Start difference. First operand 7 states and 194 transitions. Second operand 3 states. [2018-06-26 21:33:43,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:43,626 INFO ]: Finished difference Result 9 states and 253 transitions. [2018-06-26 21:33:43,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:43,627 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:33:43,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:43,628 INFO ]: With dead ends: 9 [2018-06-26 21:33:43,628 INFO ]: Without dead ends: 9 [2018-06-26 21:33:43,629 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 21:33:43,629 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:33:43,633 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:33:43,633 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:33:43,634 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions. [2018-06-26 21:33:43,634 INFO ]: Start accepts. Automaton has 9 states and 253 transitions. Word has length 6 [2018-06-26 21:33:43,634 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:43,634 INFO ]: Abstraction has 9 states and 253 transitions. [2018-06-26 21:33:43,634 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:43,634 INFO ]: Start isEmpty. Operand 9 states and 253 transitions. [2018-06-26 21:33:43,635 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:43,635 INFO ]: Found error trace [2018-06-26 21:33:43,635 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:43,635 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:43,635 INFO ]: Analyzing trace with hash 1106455062, now seen corresponding path program 1 times [2018-06-26 21:33:43,635 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:43,635 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:43,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:43,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:43,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:43,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:43,675 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:43,675 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:43,675 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:43,675 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:43,675 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:43,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:43,675 INFO ]: Start difference. First operand 9 states and 253 transitions. Second operand 3 states. [2018-06-26 21:33:44,302 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:44,302 INFO ]: Finished difference Result 13 states and 407 transitions. [2018-06-26 21:33:44,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:44,303 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:44,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:44,303 INFO ]: With dead ends: 13 [2018-06-26 21:33:44,303 INFO ]: Without dead ends: 13 [2018-06-26 21:33:44,304 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 21:33:44,304 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:44,308 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 21:33:44,308 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 21:33:44,309 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 390 transitions. [2018-06-26 21:33:44,309 INFO ]: Start accepts. Automaton has 12 states and 390 transitions. Word has length 8 [2018-06-26 21:33:44,309 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:44,309 INFO ]: Abstraction has 12 states and 390 transitions. [2018-06-26 21:33:44,309 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:44,309 INFO ]: Start isEmpty. Operand 12 states and 390 transitions. [2018-06-26 21:33:44,310 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:44,310 INFO ]: Found error trace [2018-06-26 21:33:44,310 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:44,310 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:44,310 INFO ]: Analyzing trace with hash 1111072667, now seen corresponding path program 1 times [2018-06-26 21:33:44,310 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:44,310 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:44,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:44,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,322 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:44,340 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:44,341 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:44,341 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:44,341 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:44,341 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:44,341 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:44,341 INFO ]: Start difference. First operand 12 states and 390 transitions. Second operand 3 states. [2018-06-26 21:33:44,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:44,538 INFO ]: Finished difference Result 13 states and 285 transitions. [2018-06-26 21:33:44,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:44,539 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:44,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:44,539 INFO ]: With dead ends: 13 [2018-06-26 21:33:44,539 INFO ]: Without dead ends: 13 [2018-06-26 21:33:44,539 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 21:33:44,540 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:33:44,544 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:33:44,544 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:33:44,545 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 285 transitions. [2018-06-26 21:33:44,545 INFO ]: Start accepts. Automaton has 13 states and 285 transitions. Word has length 8 [2018-06-26 21:33:44,545 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:44,545 INFO ]: Abstraction has 13 states and 285 transitions. [2018-06-26 21:33:44,545 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:44,545 INFO ]: Start isEmpty. Operand 13 states and 285 transitions. [2018-06-26 21:33:44,545 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:33:44,545 INFO ]: Found error trace [2018-06-26 21:33:44,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:44,546 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:44,546 INFO ]: Analyzing trace with hash 1110029982, now seen corresponding path program 1 times [2018-06-26 21:33:44,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:44,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:44,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:44,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,559 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:44,594 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 21:33:44,594 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:44,594 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:44,594 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:44,594 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:44,594 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:44,595 INFO ]: Start difference. First operand 13 states and 285 transitions. Second operand 3 states. [2018-06-26 21:33:44,859 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:44,859 INFO ]: Finished difference Result 19 states and 350 transitions. [2018-06-26 21:33:44,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:44,859 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:33:44,859 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:44,860 INFO ]: With dead ends: 19 [2018-06-26 21:33:44,860 INFO ]: Without dead ends: 16 [2018-06-26 21:33:44,860 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 21:33:44,861 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 21:33:44,863 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 21:33:44,863 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 21:33:44,864 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2018-06-26 21:33:44,864 INFO ]: Start accepts. Automaton has 16 states and 144 transitions. Word has length 8 [2018-06-26 21:33:44,864 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:44,864 INFO ]: Abstraction has 16 states and 144 transitions. [2018-06-26 21:33:44,864 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:44,864 INFO ]: Start isEmpty. Operand 16 states and 144 transitions. [2018-06-26 21:33:44,865 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:33:44,865 INFO ]: Found error trace [2018-06-26 21:33:44,865 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:44,865 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:44,865 INFO ]: Analyzing trace with hash 1513239863, now seen corresponding path program 1 times [2018-06-26 21:33:44,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:44,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:44,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:44,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:44,879 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:44,965 INFO ]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:44,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:44,965 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 21:33:44,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:45,004 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:45,010 INFO ]: Computing forward predicates... [2018-06-26 21:33:45,236 INFO ]: Checked inductivity of 15 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 21:33:45,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:45,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 21:33:45,270 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:33:45,270 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:33:45,270 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:33:45,270 INFO ]: Start difference. First operand 16 states and 144 transitions. Second operand 7 states. [2018-06-26 21:33:45,848 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 21:33:46,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:46,978 INFO ]: Finished difference Result 89 states and 720 transitions. [2018-06-26 21:33:46,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 21:33:46,978 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-26 21:33:46,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:46,982 INFO ]: With dead ends: 89 [2018-06-26 21:33:46,982 INFO ]: Without dead ends: 79 [2018-06-26 21:33:46,982 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-06-26 21:33:46,983 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-26 21:33:46,993 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 62. [2018-06-26 21:33:46,993 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 21:33:46,995 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 587 transitions. [2018-06-26 21:33:46,995 INFO ]: Start accepts. Automaton has 62 states and 587 transitions. Word has length 10 [2018-06-26 21:33:46,995 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:46,995 INFO ]: Abstraction has 62 states and 587 transitions. [2018-06-26 21:33:46,995 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:33:46,995 INFO ]: Start isEmpty. Operand 62 states and 587 transitions. [2018-06-26 21:33:46,996 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 21:33:46,996 INFO ]: Found error trace [2018-06-26 21:33:46,996 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:46,996 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:46,996 INFO ]: Analyzing trace with hash 1297166840, now seen corresponding path program 1 times [2018-06-26 21:33:46,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:46,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:46,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:46,997 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:46,997 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,005 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:47,029 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 21:33:47,029 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:47,029 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:47,029 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:47,029 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:47,029 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:47,029 INFO ]: Start difference. First operand 62 states and 587 transitions. Second operand 3 states. [2018-06-26 21:33:47,124 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:47,124 INFO ]: Finished difference Result 45 states and 261 transitions. [2018-06-26 21:33:47,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:47,129 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 21:33:47,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:47,130 INFO ]: With dead ends: 45 [2018-06-26 21:33:47,130 INFO ]: Without dead ends: 40 [2018-06-26 21:33:47,131 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 21:33:47,131 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 21:33:47,135 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-06-26 21:33:47,135 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 21:33:47,136 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 242 transitions. [2018-06-26 21:33:47,137 INFO ]: Start accepts. Automaton has 38 states and 242 transitions. Word has length 11 [2018-06-26 21:33:47,137 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:47,137 INFO ]: Abstraction has 38 states and 242 transitions. [2018-06-26 21:33:47,137 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:47,137 INFO ]: Start isEmpty. Operand 38 states and 242 transitions. [2018-06-26 21:33:47,138 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:33:47,138 INFO ]: Found error trace [2018-06-26 21:33:47,138 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:47,138 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:47,138 INFO ]: Analyzing trace with hash 939540440, now seen corresponding path program 1 times [2018-06-26 21:33:47,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:47,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:47,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:47,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,152 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:47,194 INFO ]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 21:33:47,194 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:47,194 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:47,195 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:47,195 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:47,195 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:47,195 INFO ]: Start difference. First operand 38 states and 242 transitions. Second operand 3 states. [2018-06-26 21:33:47,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:47,272 INFO ]: Finished difference Result 32 states and 155 transitions. [2018-06-26 21:33:47,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:47,272 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 21:33:47,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:47,273 INFO ]: With dead ends: 32 [2018-06-26 21:33:47,273 INFO ]: Without dead ends: 30 [2018-06-26 21:33:47,273 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 21:33:47,274 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 21:33:47,277 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-06-26 21:33:47,277 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 21:33:47,278 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 145 transitions. [2018-06-26 21:33:47,278 INFO ]: Start accepts. Automaton has 29 states and 145 transitions. Word has length 14 [2018-06-26 21:33:47,278 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:47,278 INFO ]: Abstraction has 29 states and 145 transitions. [2018-06-26 21:33:47,278 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:47,278 INFO ]: Start isEmpty. Operand 29 states and 145 transitions. [2018-06-26 21:33:47,279 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:33:47,279 INFO ]: Found error trace [2018-06-26 21:33:47,279 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:47,279 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:47,279 INFO ]: Analyzing trace with hash 2103143675, now seen corresponding path program 1 times [2018-06-26 21:33:47,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:47,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:47,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:47,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,294 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:47,371 INFO ]: Checked inductivity of 45 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-26 21:33:47,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:47,371 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:47,373 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:47,373 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:47,373 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:47,373 INFO ]: Start difference. First operand 29 states and 145 transitions. Second operand 3 states. [2018-06-26 21:33:47,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:47,542 INFO ]: Finished difference Result 44 states and 194 transitions. [2018-06-26 21:33:47,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:47,542 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 21:33:47,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:47,543 INFO ]: With dead ends: 44 [2018-06-26 21:33:47,543 INFO ]: Without dead ends: 35 [2018-06-26 21:33:47,543 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 21:33:47,543 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 21:33:47,548 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-26 21:33:47,548 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 21:33:47,549 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 147 transitions. [2018-06-26 21:33:47,549 INFO ]: Start accepts. Automaton has 29 states and 147 transitions. Word has length 14 [2018-06-26 21:33:47,549 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:47,549 INFO ]: Abstraction has 29 states and 147 transitions. [2018-06-26 21:33:47,549 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:47,549 INFO ]: Start isEmpty. Operand 29 states and 147 transitions. [2018-06-26 21:33:47,550 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:33:47,550 INFO ]: Found error trace [2018-06-26 21:33:47,550 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:47,550 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:47,550 INFO ]: Analyzing trace with hash 2060870246, now seen corresponding path program 1 times [2018-06-26 21:33:47,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:47,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:47,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,551 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:47,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:47,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:47,712 INFO ]: Checked inductivity of 45 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 21:33:47,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:47,713 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 21:33:47,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:47,770 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:47,773 INFO ]: Computing forward predicates... [2018-06-26 21:33:47,802 INFO ]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 21:33:47,820 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 21:33:47,821 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-06-26 21:33:47,821 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:33:47,821 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:33:47,821 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:33:47,821 INFO ]: Start difference. First operand 29 states and 147 transitions. Second operand 7 states. [2018-06-26 21:33:49,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:49,301 INFO ]: Finished difference Result 163 states and 714 transitions. [2018-06-26 21:33:49,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 21:33:49,301 INFO ]: Start accepts. Automaton has 7 states. Word has length 14 [2018-06-26 21:33:49,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:49,303 INFO ]: With dead ends: 163 [2018-06-26 21:33:49,303 INFO ]: Without dead ends: 104 [2018-06-26 21:33:49,304 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2018-06-26 21:33:49,304 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-26 21:33:49,312 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 74. [2018-06-26 21:33:49,312 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-26 21:33:49,314 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 384 transitions. [2018-06-26 21:33:49,314 INFO ]: Start accepts. Automaton has 74 states and 384 transitions. Word has length 14 [2018-06-26 21:33:49,314 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:49,314 INFO ]: Abstraction has 74 states and 384 transitions. [2018-06-26 21:33:49,314 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:33:49,314 INFO ]: Start isEmpty. Operand 74 states and 384 transitions. [2018-06-26 21:33:49,315 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:33:49,315 INFO ]: Found error trace [2018-06-26 21:33:49,315 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:49,315 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:49,315 INFO ]: Analyzing trace with hash 253415783, now seen corresponding path program 1 times [2018-06-26 21:33:49,315 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:49,315 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:49,316 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,317 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,317 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:49,328 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,396 INFO ]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 21:33:49,396 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:49,396 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:49,590 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:49,629 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:49,632 INFO ]: Computing forward predicates... [2018-06-26 21:33:49,914 INFO ]: Checked inductivity of 45 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 21:33:49,946 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:49,946 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-26 21:33:49,946 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:33:49,946 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:33:49,947 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:33:49,947 INFO ]: Start difference. First operand 74 states and 384 transitions. Second operand 9 states. [2018-06-26 21:33:50,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:50,726 INFO ]: Finished difference Result 143 states and 597 transitions. [2018-06-26 21:33:50,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 21:33:50,732 INFO ]: Start accepts. Automaton has 9 states. Word has length 14 [2018-06-26 21:33:50,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:50,734 INFO ]: With dead ends: 143 [2018-06-26 21:33:50,734 INFO ]: Without dead ends: 132 [2018-06-26 21:33:50,734 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-06-26 21:33:50,734 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-26 21:33:50,746 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 69. [2018-06-26 21:33:50,746 INFO ]: Start removeUnreachable. Operand 69 states. [2018-06-26 21:33:50,747 INFO ]: Finished removeUnreachable. Reduced from 69 states to 69 states and 346 transitions. [2018-06-26 21:33:50,747 INFO ]: Start accepts. Automaton has 69 states and 346 transitions. Word has length 14 [2018-06-26 21:33:50,747 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:50,747 INFO ]: Abstraction has 69 states and 346 transitions. [2018-06-26 21:33:50,747 INFO ]: Interpolant automaton has 9 states. [2018-06-26 21:33:50,747 INFO ]: Start isEmpty. Operand 69 states and 346 transitions. [2018-06-26 21:33:50,748 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:33:50,748 INFO ]: Found error trace [2018-06-26 21:33:50,748 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:50,748 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:50,748 INFO ]: Analyzing trace with hash -445576761, now seen corresponding path program 1 times [2018-06-26 21:33:50,748 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:50,748 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:50,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:50,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:50,749 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:50,758 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:50,837 INFO ]: Checked inductivity of 45 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:33:50,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:50,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:33:50,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:50,884 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:50,888 INFO ]: Computing forward predicates... [2018-06-26 21:33:51,122 INFO ]: Checked inductivity of 45 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 21:33:51,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:51,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-26 21:33:51,150 INFO ]: Interpolant automaton has 12 states [2018-06-26 21:33:51,150 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 21:33:51,150 INFO ]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-26 21:33:51,150 INFO ]: Start difference. First operand 69 states and 346 transitions. Second operand 12 states. [2018-06-26 21:33:52,393 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:52,393 INFO ]: Finished difference Result 178 states and 727 transitions. [2018-06-26 21:33:52,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 21:33:52,393 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-26 21:33:52,394 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:52,395 INFO ]: With dead ends: 178 [2018-06-26 21:33:52,395 INFO ]: Without dead ends: 161 [2018-06-26 21:33:52,395 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-06-26 21:33:52,395 INFO ]: Start minimizeSevpa. Operand 161 states. [2018-06-26 21:33:52,404 INFO ]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-06-26 21:33:52,404 INFO ]: Start removeUnreachable. Operand 113 states. [2018-06-26 21:33:52,405 INFO ]: Finished removeUnreachable. Reduced from 113 states to 113 states and 548 transitions. [2018-06-26 21:33:52,405 INFO ]: Start accepts. Automaton has 113 states and 548 transitions. Word has length 14 [2018-06-26 21:33:52,405 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:52,405 INFO ]: Abstraction has 113 states and 548 transitions. [2018-06-26 21:33:52,405 INFO ]: Interpolant automaton has 12 states. [2018-06-26 21:33:52,406 INFO ]: Start isEmpty. Operand 113 states and 548 transitions. [2018-06-26 21:33:52,407 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 21:33:52,407 INFO ]: Found error trace [2018-06-26 21:33:52,407 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:52,407 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:52,407 INFO ]: Analyzing trace with hash 1282655756, now seen corresponding path program 1 times [2018-06-26 21:33:52,407 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:52,407 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:52,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:52,408 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:52,408 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:52,422 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:52,483 INFO ]: Checked inductivity of 91 backedges. 35 proven. 45 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 21:33:52,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:52,483 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:52,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:52,545 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:52,548 INFO ]: Computing forward predicates... [2018-06-26 21:33:52,658 INFO ]: Checked inductivity of 91 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 21:33:52,677 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:52,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-26 21:33:52,677 INFO ]: Interpolant automaton has 13 states [2018-06-26 21:33:52,677 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 21:33:52,678 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-26 21:33:52,678 INFO ]: Start difference. First operand 113 states and 548 transitions. Second operand 13 states. [2018-06-26 21:33:53,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:53,845 INFO ]: Finished difference Result 284 states and 1165 transitions. [2018-06-26 21:33:53,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 21:33:53,848 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-26 21:33:53,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:53,851 INFO ]: With dead ends: 284 [2018-06-26 21:33:53,851 INFO ]: Without dead ends: 264 [2018-06-26 21:33:53,851 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2018-06-26 21:33:53,851 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-26 21:33:53,869 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 143. [2018-06-26 21:33:53,869 INFO ]: Start removeUnreachable. Operand 143 states. [2018-06-26 21:33:53,871 INFO ]: Finished removeUnreachable. Reduced from 143 states to 143 states and 644 transitions. [2018-06-26 21:33:53,872 INFO ]: Start accepts. Automaton has 143 states and 644 transitions. Word has length 18 [2018-06-26 21:33:53,872 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:53,872 INFO ]: Abstraction has 143 states and 644 transitions. [2018-06-26 21:33:53,872 INFO ]: Interpolant automaton has 13 states. [2018-06-26 21:33:53,872 INFO ]: Start isEmpty. Operand 143 states and 644 transitions. [2018-06-26 21:33:53,873 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 21:33:53,873 INFO ]: Found error trace [2018-06-26 21:33:53,873 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:53,873 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:53,873 INFO ]: Analyzing trace with hash 574017132, now seen corresponding path program 2 times [2018-06-26 21:33:53,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:53,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:53,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:53,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:53,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:53,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:54,032 INFO ]: Checked inductivity of 91 backedges. 28 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 21:33:54,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:54,032 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:54,038 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:33:54,094 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:33:54,094 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:54,099 INFO ]: Computing forward predicates... [2018-06-26 21:33:54,214 INFO ]: Checked inductivity of 91 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-26 21:33:54,233 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:54,233 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-06-26 21:33:54,234 INFO ]: Interpolant automaton has 15 states [2018-06-26 21:33:54,234 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 21:33:54,234 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-26 21:33:54,234 INFO ]: Start difference. First operand 143 states and 644 transitions. Second operand 15 states. [2018-06-26 21:33:55,291 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:55,291 INFO ]: Finished difference Result 348 states and 1315 transitions. [2018-06-26 21:33:55,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 21:33:55,292 INFO ]: Start accepts. Automaton has 15 states. Word has length 18 [2018-06-26 21:33:55,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:55,295 INFO ]: With dead ends: 348 [2018-06-26 21:33:55,295 INFO ]: Without dead ends: 319 [2018-06-26 21:33:55,295 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-06-26 21:33:55,295 INFO ]: Start minimizeSevpa. Operand 319 states. [2018-06-26 21:33:55,315 INFO ]: Finished minimizeSevpa. Reduced states from 319 to 200. [2018-06-26 21:33:55,315 INFO ]: Start removeUnreachable. Operand 200 states. [2018-06-26 21:33:55,318 INFO ]: Finished removeUnreachable. Reduced from 200 states to 200 states and 864 transitions. [2018-06-26 21:33:55,318 INFO ]: Start accepts. Automaton has 200 states and 864 transitions. Word has length 18 [2018-06-26 21:33:55,318 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:55,318 INFO ]: Abstraction has 200 states and 864 transitions. [2018-06-26 21:33:55,318 INFO ]: Interpolant automaton has 15 states. [2018-06-26 21:33:55,318 INFO ]: Start isEmpty. Operand 200 states and 864 transitions. [2018-06-26 21:33:55,319 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 21:33:55,319 INFO ]: Found error trace [2018-06-26 21:33:55,319 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:55,319 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:55,320 INFO ]: Analyzing trace with hash 1162815452, now seen corresponding path program 1 times [2018-06-26 21:33:55,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:55,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:55,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:33:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:55,336 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:55,405 INFO ]: Checked inductivity of 105 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-26 21:33:55,405 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:33:55,405 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:33:55,405 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:33:55,405 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:33:55,405 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:33:55,406 INFO ]: Start difference. First operand 200 states and 864 transitions. Second operand 3 states. [2018-06-26 21:33:56,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:56,214 INFO ]: Finished difference Result 48 states and 114 transitions. [2018-06-26 21:33:56,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:33:56,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 21:33:56,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:56,215 INFO ]: With dead ends: 48 [2018-06-26 21:33:56,215 INFO ]: Without dead ends: 28 [2018-06-26 21:33:56,215 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 21:33:56,215 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 21:33:56,217 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-26 21:33:56,217 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 21:33:56,217 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-06-26 21:33:56,217 INFO ]: Start accepts. Automaton has 23 states and 52 transitions. Word has length 19 [2018-06-26 21:33:56,217 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:56,217 INFO ]: Abstraction has 23 states and 52 transitions. [2018-06-26 21:33:56,217 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:33:56,217 INFO ]: Start isEmpty. Operand 23 states and 52 transitions. [2018-06-26 21:33:56,218 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:33:56,218 INFO ]: Found error trace [2018-06-26 21:33:56,218 INFO ]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:56,218 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:56,218 INFO ]: Analyzing trace with hash 1277253476, now seen corresponding path program 1 times [2018-06-26 21:33:56,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:56,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:56,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:56,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:56,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:56,243 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:56,382 INFO ]: Checked inductivity of 153 backedges. 43 proven. 85 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 21:33:56,382 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:56,382 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:56,388 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:56,445 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:56,451 INFO ]: Computing forward predicates... [2018-06-26 21:33:56,725 INFO ]: Checked inductivity of 153 backedges. 38 proven. 107 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 21:33:56,745 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:56,745 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-06-26 21:33:56,745 INFO ]: Interpolant automaton has 18 states [2018-06-26 21:33:56,745 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 21:33:56,745 INFO ]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-06-26 21:33:56,745 INFO ]: Start difference. First operand 23 states and 52 transitions. Second operand 18 states. [2018-06-26 21:33:57,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:57,103 INFO ]: Finished difference Result 43 states and 95 transitions. [2018-06-26 21:33:57,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 21:33:57,103 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-26 21:33:57,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:57,104 INFO ]: With dead ends: 43 [2018-06-26 21:33:57,104 INFO ]: Without dead ends: 38 [2018-06-26 21:33:57,104 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-06-26 21:33:57,104 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 21:33:57,105 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-06-26 21:33:57,105 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 21:33:57,105 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 60 transitions. [2018-06-26 21:33:57,105 INFO ]: Start accepts. Automaton has 27 states and 60 transitions. Word has length 22 [2018-06-26 21:33:57,106 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:57,106 INFO ]: Abstraction has 27 states and 60 transitions. [2018-06-26 21:33:57,106 INFO ]: Interpolant automaton has 18 states. [2018-06-26 21:33:57,106 INFO ]: Start isEmpty. Operand 27 states and 60 transitions. [2018-06-26 21:33:57,106 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 21:33:57,106 INFO ]: Found error trace [2018-06-26 21:33:57,106 INFO ]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:33:57,106 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:33:57,106 INFO ]: Analyzing trace with hash 587426855, now seen corresponding path program 1 times [2018-06-26 21:33:57,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:33:57,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:33:57,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:57,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:57,107 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:33:57,122 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:57,272 INFO ]: Checked inductivity of 231 backedges. 64 proven. 126 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-26 21:33:57,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:33:57,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:33:57,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:33:57,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:33:57,354 INFO ]: Computing forward predicates... [2018-06-26 21:33:57,755 INFO ]: Checked inductivity of 231 backedges. 46 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 21:33:57,777 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:33:57,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2018-06-26 21:33:57,777 INFO ]: Interpolant automaton has 21 states [2018-06-26 21:33:57,777 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 21:33:57,777 INFO ]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-26 21:33:57,778 INFO ]: Start difference. First operand 27 states and 60 transitions. Second operand 21 states. [2018-06-26 21:33:58,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:33:58,140 INFO ]: Finished difference Result 37 states and 75 transitions. [2018-06-26 21:33:58,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 21:33:58,140 INFO ]: Start accepts. Automaton has 21 states. Word has length 26 [2018-06-26 21:33:58,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:33:58,140 INFO ]: With dead ends: 37 [2018-06-26 21:33:58,140 INFO ]: Without dead ends: 0 [2018-06-26 21:33:58,141 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-06-26 21:33:58,141 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 21:33:58,141 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 21:33:58,141 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 21:33:58,141 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 21:33:58,141 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-06-26 21:33:58,141 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:33:58,141 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 21:33:58,141 INFO ]: Interpolant automaton has 21 states. [2018-06-26 21:33:58,141 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 21:33:58,141 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 21:33:58,144 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:33:58,146 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:33:58 BasicIcfg [2018-06-26 21:33:58,146 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:33:58,146 INFO ]: Toolchain (without parser) took 20806.02 ms. Allocated memory was 309.9 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 264.3 MB in the beginning and 809.6 MB in the end (delta: -545.3 MB). Peak memory consumption was 578.8 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,147 INFO ]: SmtParser took 0.11 ms. Allocated memory is still 309.9 MB. Free memory is still 275.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:33:58,148 INFO ]: ChcToBoogie took 59.73 ms. Allocated memory is still 309.9 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,148 INFO ]: Boogie Preprocessor took 46.91 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 260.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,149 INFO ]: RCFGBuilder took 250.69 ms. Allocated memory is still 309.9 MB. Free memory was 260.4 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,149 INFO ]: BlockEncodingV2 took 3423.02 ms. Allocated memory was 309.9 MB in the beginning and 667.4 MB in the end (delta: 357.6 MB). Free memory was 252.3 MB in the beginning and 275.5 MB in the end (delta: -23.2 MB). Peak memory consumption was 535.6 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,150 INFO ]: TraceAbstraction took 17016.41 ms. Allocated memory was 667.4 MB in the beginning and 1.4 GB in the end (delta: 766.5 MB). Free memory was 275.5 MB in the beginning and 809.6 MB in the end (delta: -534.1 MB). Peak memory consumption was 232.4 MB. Max. memory is 3.6 GB. [2018-06-26 21:33:58,157 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, 142 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.11 ms. Allocated memory is still 309.9 MB. Free memory is still 275.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.73 ms. Allocated memory is still 309.9 MB. Free memory was 264.3 MB in the beginning and 262.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.91 ms. Allocated memory is still 309.9 MB. Free memory was 262.3 MB in the beginning and 260.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 250.69 ms. Allocated memory is still 309.9 MB. Free memory was 260.4 MB in the beginning and 252.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 3423.02 ms. Allocated memory was 309.9 MB in the beginning and 667.4 MB in the end (delta: 357.6 MB). Free memory was 252.3 MB in the beginning and 275.5 MB in the end (delta: -23.2 MB). Peak memory consumption was 535.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 17016.41 ms. Allocated memory was 667.4 MB in the beginning and 1.4 GB in the end (delta: 766.5 MB). Free memory was 275.5 MB in the beginning and 809.6 MB in the end (delta: -534.1 MB). Peak memory consumption was 232.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 16.9s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 38 SDslu, 417 SDs, 0 SdLazy, 8644 SolverSat, 3394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 162 SyntacticMatches, 9 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=14, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 424 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 34158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3192 ConjunctsInSsa, 1001 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 930/1667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ken-imp.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-33-58-175.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ken-imp.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-33-58-175.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ken-imp.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-33-58-175.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ken-imp.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-33-58-175.csv Received shutdown request...