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/fig1a.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 21:28:13,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 21:28:13,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 21:28:13,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 21:28:13,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 21:28:13,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 21:28:13,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 21:28:13,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 21:28:13,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 21:28:13,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 21:28:13,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 21:28:13,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 21:28:13,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 21:28:13,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 21:28:13,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 21:28:13,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 21:28:13,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 21:28:13,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 21:28:13,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 21:28:13,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 21:28:13,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 21:28:13,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 21:28:13,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 21:28:13,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 21:28:13,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 21:28:13,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 21:28:13,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 21:28:13,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 21:28:13,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 21:28:13,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 21:28:13,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 21:28:13,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 21:28:13,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 21:28:13,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 21:28:13,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 21:28:13,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 21:28:13,874 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:28:13,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 21:28:13,888 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 21:28:13,888 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 21:28:13,888 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 21:28:13,889 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 21:28:13,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 21:28:13,890 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 21:28:13,890 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 21:28:13,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 21:28:13,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 21:28:13,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 21:28:13,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 21:28:13,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:28:13,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 21:28:13,891 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 21:28:13,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 21:28:13,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 21:28:13,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 21:28:13,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 21:28:13,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 21:28:13,892 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 21:28:13,894 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 21:28:13,894 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 21:28:13,942 INFO ]: Repository-Root is: /tmp [2018-06-26 21:28:13,955 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 21:28:13,959 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 21:28:13,960 INFO ]: Initializing SmtParser... [2018-06-26 21:28:13,961 INFO ]: SmtParser initialized [2018-06-26 21:28:13,961 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/ctigar/fig1a.c.smt2 [2018-06-26 21:28:13,962 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:28:14,053 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/fig1a.c.smt2 unknown [2018-06-26 21:28:14,248 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/ctigar/fig1a.c.smt2 [2018-06-26 21:28:14,252 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 21:28:14,258 INFO ]: Walking toolchain with 5 elements. [2018-06-26 21:28:14,258 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 21:28:14,258 INFO ]: Initializing ChcToBoogie... [2018-06-26 21:28:14,258 INFO ]: ChcToBoogie initialized [2018-06-26 21:28:14,262 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,320 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14 Unit [2018-06-26 21:28:14,320 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 21:28:14,321 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 21:28:14,321 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 21:28:14,321 INFO ]: Boogie Preprocessor initialized [2018-06-26 21:28:14,344 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,344 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,350 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,350 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,355 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,356 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,363 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,364 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 21:28:14,365 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 21:28:14,365 INFO ]: Initializing RCFGBuilder... [2018-06-26 21:28:14,365 INFO ]: RCFGBuilder initialized [2018-06-26 21:28:14,375 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 21:28:14,393 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 21:28:14,393 INFO ]: Found specification of procedure gotoProc [2018-06-26 21:28:14,393 INFO ]: Found implementation of procedure gotoProc [2018-06-26 21:28:14,393 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 21:28:14,393 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 21:28:14,393 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 21:28:14,662 INFO ]: Using library mode [2018-06-26 21:28:14,662 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:28:14 BoogieIcfgContainer [2018-06-26 21:28:14,662 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 21:28:14,663 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 21:28:14,663 INFO ]: Initializing BlockEncodingV2... [2018-06-26 21:28:14,666 INFO ]: BlockEncodingV2 initialized [2018-06-26 21:28:14,667 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:28:14" (1/1) ... [2018-06-26 21:28:14,681 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 21:28:14,683 INFO ]: Using Remove infeasible edges [2018-06-26 21:28:14,683 INFO ]: Using Maximize final states [2018-06-26 21:28:14,684 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 21:28:14,684 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 21:28:14,685 INFO ]: Using Remove sink states [2018-06-26 21:28:14,686 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 21:28:14,686 INFO ]: Using Use SBE [2018-06-26 21:28:14,694 WARN ]: expecting exponential blowup for input size 22 [2018-06-26 21:28:29,787 INFO ]: SBE split 1 edges [2018-06-26 21:28:29,801 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 21:28:29,804 INFO ]: 0 new accepting states [2018-06-26 21:28:29,862 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 21:28:29,864 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:28:29,879 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 21:28:29,879 INFO ]: 0 new accepting states [2018-06-26 21:28:29,879 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 21:28:29,879 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 21:28:29,915 INFO ]: Encoded RCFG 6 locations, 176 edges [2018-06-26 21:28:29,916 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:28:29 BasicIcfg [2018-06-26 21:28:29,916 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 21:28:29,916 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 21:28:29,917 INFO ]: Initializing TraceAbstraction... [2018-06-26 21:28:29,920 INFO ]: TraceAbstraction initialized [2018-06-26 21:28:29,920 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 09:28:14" (1/4) ... [2018-06-26 21:28:29,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 09:28:29, skipping insertion in model container [2018-06-26 21:28:29,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 09:28:14" (2/4) ... [2018-06-26 21:28:29,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 09:28:29, skipping insertion in model container [2018-06-26 21:28:29,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 09:28:14" (3/4) ... [2018-06-26 21:28:29,921 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ae734b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:28:29, skipping insertion in model container [2018-06-26 21:28:29,921 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 09:28:29" (4/4) ... [2018-06-26 21:28:29,923 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 21:28:29,945 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 21:28:29,956 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 21:28:30,009 INFO ]: Using default assertion order modulation [2018-06-26 21:28:30,010 INFO ]: Interprodecural is true [2018-06-26 21:28:30,010 INFO ]: Hoare is false [2018-06-26 21:28:30,010 INFO ]: Compute interpolants for FPandBP [2018-06-26 21:28:30,010 INFO ]: Backedges is TWOTRACK [2018-06-26 21:28:30,010 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 21:28:30,010 INFO ]: Difference is false [2018-06-26 21:28:30,010 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 21:28:30,010 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 21:28:30,026 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 21:28:30,049 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 21:28:30,049 INFO ]: Found error trace [2018-06-26 21:28:30,050 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 21:28:30,050 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:30,056 INFO ]: Analyzing trace with hash 40661154, now seen corresponding path program 1 times [2018-06-26 21:28:30,058 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:30,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:30,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:30,094 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:30,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:30,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:30,231 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:28:30,235 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:30,235 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:30,237 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:30,254 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:30,254 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:30,257 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 21:28:31,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:31,851 INFO ]: Finished difference Result 7 states and 274 transitions. [2018-06-26 21:28:31,852 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:31,853 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 21:28:31,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:31,863 INFO ]: With dead ends: 7 [2018-06-26 21:28:31,863 INFO ]: Without dead ends: 7 [2018-06-26 21:28:31,865 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:28:31,882 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 21:28:31,902 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 21:28:31,904 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 21:28:31,905 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 274 transitions. [2018-06-26 21:28:31,906 INFO ]: Start accepts. Automaton has 7 states and 274 transitions. Word has length 5 [2018-06-26 21:28:31,907 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:31,907 INFO ]: Abstraction has 7 states and 274 transitions. [2018-06-26 21:28:31,907 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:31,907 INFO ]: Start isEmpty. Operand 7 states and 274 transitions. [2018-06-26 21:28:31,907 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:28:31,907 INFO ]: Found error trace [2018-06-26 21:28:31,908 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:28:31,908 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:31,908 INFO ]: Analyzing trace with hash 1255567925, now seen corresponding path program 1 times [2018-06-26 21:28:31,908 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:31,908 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:31,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:31,909 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:31,909 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:31,916 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:31,978 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:28:31,978 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:31,978 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:31,980 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:31,980 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:31,980 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:31,980 INFO ]: Start difference. First operand 7 states and 274 transitions. Second operand 3 states. [2018-06-26 21:28:33,208 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:33,208 INFO ]: Finished difference Result 9 states and 413 transitions. [2018-06-26 21:28:33,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:33,208 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:28:33,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:33,209 INFO ]: With dead ends: 9 [2018-06-26 21:28:33,209 INFO ]: Without dead ends: 9 [2018-06-26 21:28:33,210 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:28:33,210 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 21:28:33,216 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 21:28:33,216 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 21:28:33,218 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2018-06-26 21:28:33,218 INFO ]: Start accepts. Automaton has 9 states and 413 transitions. Word has length 6 [2018-06-26 21:28:33,218 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:33,218 INFO ]: Abstraction has 9 states and 413 transitions. [2018-06-26 21:28:33,218 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:33,218 INFO ]: Start isEmpty. Operand 9 states and 413 transitions. [2018-06-26 21:28:33,219 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 21:28:33,219 INFO ]: Found error trace [2018-06-26 21:28:33,219 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 21:28:33,219 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:33,219 INFO ]: Analyzing trace with hash 1259470546, now seen corresponding path program 1 times [2018-06-26 21:28:33,219 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:33,219 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:33,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:33,220 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:33,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:33,226 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:33,256 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:28:33,256 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:33,256 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:33,257 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:33,257 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:33,257 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:33,257 INFO ]: Start difference. First operand 9 states and 413 transitions. Second operand 3 states. [2018-06-26 21:28:33,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:33,905 INFO ]: Finished difference Result 13 states and 627 transitions. [2018-06-26 21:28:33,905 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:33,906 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 21:28:33,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:33,907 INFO ]: With dead ends: 13 [2018-06-26 21:28:33,907 INFO ]: Without dead ends: 13 [2018-06-26 21:28:33,907 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:33,908 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:28:33,915 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:28:33,915 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:28:33,917 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2018-06-26 21:28:33,917 INFO ]: Start accepts. Automaton has 13 states and 627 transitions. Word has length 6 [2018-06-26 21:28:33,917 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:33,917 INFO ]: Abstraction has 13 states and 627 transitions. [2018-06-26 21:28:33,917 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:33,917 INFO ]: Start isEmpty. Operand 13 states and 627 transitions. [2018-06-26 21:28:33,918 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:28:33,918 INFO ]: Found error trace [2018-06-26 21:28:33,918 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:33,918 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:33,918 INFO ]: Analyzing trace with hash -1263406713, now seen corresponding path program 1 times [2018-06-26 21:28:33,918 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:33,918 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:33,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:33,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:33,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:33,927 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:33,959 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:28:33,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:33,959 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:33,959 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:33,959 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:33,959 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:33,959 INFO ]: Start difference. First operand 13 states and 627 transitions. Second operand 3 states. [2018-06-26 21:28:34,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:34,253 INFO ]: Finished difference Result 13 states and 413 transitions. [2018-06-26 21:28:34,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:34,253 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:28:34,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:34,254 INFO ]: With dead ends: 13 [2018-06-26 21:28:34,254 INFO ]: Without dead ends: 13 [2018-06-26 21:28:34,254 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:28:34,254 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 21:28:34,259 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 21:28:34,259 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 21:28:34,260 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 413 transitions. [2018-06-26 21:28:34,260 INFO ]: Start accepts. Automaton has 13 states and 413 transitions. Word has length 8 [2018-06-26 21:28:34,260 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:34,260 INFO ]: Abstraction has 13 states and 413 transitions. [2018-06-26 21:28:34,260 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:34,260 INFO ]: Start isEmpty. Operand 13 states and 413 transitions. [2018-06-26 21:28:34,261 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 21:28:34,261 INFO ]: Found error trace [2018-06-26 21:28:34,261 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:34,261 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:34,261 INFO ]: Analyzing trace with hash -1347447124, now seen corresponding path program 1 times [2018-06-26 21:28:34,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:34,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:34,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:34,262 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:34,262 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:34,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:34,320 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:28:34,320 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:34,320 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:34,320 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:34,320 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:34,320 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:34,321 INFO ]: Start difference. First operand 13 states and 413 transitions. Second operand 3 states. [2018-06-26 21:28:34,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:34,805 INFO ]: Finished difference Result 19 states and 563 transitions. [2018-06-26 21:28:34,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:34,862 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 21:28:34,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:34,863 INFO ]: With dead ends: 19 [2018-06-26 21:28:34,863 INFO ]: Without dead ends: 18 [2018-06-26 21:28:34,864 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:28:34,864 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 21:28:34,868 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 21:28:34,869 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 21:28:34,870 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 304 transitions. [2018-06-26 21:28:34,870 INFO ]: Start accepts. Automaton has 18 states and 304 transitions. Word has length 8 [2018-06-26 21:28:34,870 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:34,870 INFO ]: Abstraction has 18 states and 304 transitions. [2018-06-26 21:28:34,870 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:34,870 INFO ]: Start isEmpty. Operand 18 states and 304 transitions. [2018-06-26 21:28:34,870 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 21:28:34,870 INFO ]: Found error trace [2018-06-26 21:28:34,870 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:34,870 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:34,871 INFO ]: Analyzing trace with hash 2139279561, now seen corresponding path program 1 times [2018-06-26 21:28:34,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:34,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:34,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:34,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:34,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:34,892 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:34,948 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 21:28:34,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:34,948 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:34,948 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:34,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:34,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:34,949 INFO ]: Start difference. First operand 18 states and 304 transitions. Second operand 3 states. [2018-06-26 21:28:35,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:35,531 INFO ]: Finished difference Result 31 states and 506 transitions. [2018-06-26 21:28:35,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:35,532 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 21:28:35,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:35,534 INFO ]: With dead ends: 31 [2018-06-26 21:28:35,534 INFO ]: Without dead ends: 31 [2018-06-26 21:28:35,535 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:28:35,535 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 21:28:35,540 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-26 21:28:35,544 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 21:28:35,545 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 496 transitions. [2018-06-26 21:28:35,545 INFO ]: Start accepts. Automaton has 29 states and 496 transitions. Word has length 10 [2018-06-26 21:28:35,545 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:35,545 INFO ]: Abstraction has 29 states and 496 transitions. [2018-06-26 21:28:35,545 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:35,545 INFO ]: Start isEmpty. Operand 29 states and 496 transitions. [2018-06-26 21:28:35,546 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 21:28:35,546 INFO ]: Found error trace [2018-06-26 21:28:35,546 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:35,546 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:35,546 INFO ]: Analyzing trace with hash 1547308214, now seen corresponding path program 1 times [2018-06-26 21:28:35,546 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:35,546 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:35,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:35,547 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:35,547 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:35,560 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:35,591 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 21:28:35,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:35,591 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:35,591 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:35,591 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:35,592 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:35,592 INFO ]: Start difference. First operand 29 states and 496 transitions. Second operand 3 states. [2018-06-26 21:28:35,839 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:35,839 INFO ]: Finished difference Result 49 states and 746 transitions. [2018-06-26 21:28:35,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:35,842 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 21:28:35,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:35,844 INFO ]: With dead ends: 49 [2018-06-26 21:28:35,844 INFO ]: Without dead ends: 49 [2018-06-26 21:28:35,844 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:35,844 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 21:28:35,860 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-06-26 21:28:35,860 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 21:28:35,862 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 663 transitions. [2018-06-26 21:28:35,862 INFO ]: Start accepts. Automaton has 41 states and 663 transitions. Word has length 13 [2018-06-26 21:28:35,862 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:35,862 INFO ]: Abstraction has 41 states and 663 transitions. [2018-06-26 21:28:35,862 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:35,862 INFO ]: Start isEmpty. Operand 41 states and 663 transitions. [2018-06-26 21:28:35,865 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 21:28:35,865 INFO ]: Found error trace [2018-06-26 21:28:35,865 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:35,865 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:35,865 INFO ]: Analyzing trace with hash -1602159418, now seen corresponding path program 1 times [2018-06-26 21:28:35,865 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:35,865 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:35,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:35,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:35,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:35,877 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:35,904 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 21:28:35,904 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:35,904 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:35,904 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:35,904 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:35,904 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:35,904 INFO ]: Start difference. First operand 41 states and 663 transitions. Second operand 3 states. [2018-06-26 21:28:36,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:36,109 INFO ]: Finished difference Result 43 states and 434 transitions. [2018-06-26 21:28:36,109 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:36,109 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 21:28:36,109 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:36,110 INFO ]: With dead ends: 43 [2018-06-26 21:28:36,110 INFO ]: Without dead ends: 41 [2018-06-26 21:28:36,111 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:28:36,111 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 21:28:36,115 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 21:28:36,115 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 21:28:36,116 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 424 transitions. [2018-06-26 21:28:36,116 INFO ]: Start accepts. Automaton has 41 states and 424 transitions. Word has length 13 [2018-06-26 21:28:36,116 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:36,116 INFO ]: Abstraction has 41 states and 424 transitions. [2018-06-26 21:28:36,116 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:36,116 INFO ]: Start isEmpty. Operand 41 states and 424 transitions. [2018-06-26 21:28:36,117 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:28:36,117 INFO ]: Found error trace [2018-06-26 21:28:36,117 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:36,117 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:36,117 INFO ]: Analyzing trace with hash 2038523219, now seen corresponding path program 1 times [2018-06-26 21:28:36,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:36,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:36,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:36,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:36,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:36,131 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:36,158 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:28:36,159 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:36,159 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:28:36,159 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:36,159 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:36,159 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:36,159 INFO ]: Start difference. First operand 41 states and 424 transitions. Second operand 4 states. [2018-06-26 21:28:37,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:37,438 INFO ]: Finished difference Result 104 states and 1036 transitions. [2018-06-26 21:28:37,439 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:37,439 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 21:28:37,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:37,441 INFO ]: With dead ends: 104 [2018-06-26 21:28:37,441 INFO ]: Without dead ends: 97 [2018-06-26 21:28:37,441 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:37,441 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-26 21:28:37,452 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-06-26 21:28:37,452 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 21:28:37,453 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 847 transitions. [2018-06-26 21:28:37,453 INFO ]: Start accepts. Automaton has 79 states and 847 transitions. Word has length 14 [2018-06-26 21:28:37,454 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:37,454 INFO ]: Abstraction has 79 states and 847 transitions. [2018-06-26 21:28:37,454 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:37,454 INFO ]: Start isEmpty. Operand 79 states and 847 transitions. [2018-06-26 21:28:37,455 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 21:28:37,455 INFO ]: Found error trace [2018-06-26 21:28:37,455 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:37,455 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:37,455 INFO ]: Analyzing trace with hash 271188235, now seen corresponding path program 1 times [2018-06-26 21:28:37,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:37,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:37,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:37,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:37,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:37,469 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:37,534 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:28:37,534 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:37,534 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:28:37,534 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:37,534 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:37,534 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:37,534 INFO ]: Start difference. First operand 79 states and 847 transitions. Second operand 4 states. [2018-06-26 21:28:37,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:37,877 INFO ]: Finished difference Result 134 states and 1328 transitions. [2018-06-26 21:28:37,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:37,877 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-26 21:28:37,877 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:37,880 INFO ]: With dead ends: 134 [2018-06-26 21:28:37,880 INFO ]: Without dead ends: 127 [2018-06-26 21:28:37,880 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:37,880 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 21:28:37,890 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-06-26 21:28:37,890 INFO ]: Start removeUnreachable. Operand 109 states. [2018-06-26 21:28:37,892 INFO ]: Finished removeUnreachable. Reduced from 109 states to 109 states and 1124 transitions. [2018-06-26 21:28:37,892 INFO ]: Start accepts. Automaton has 109 states and 1124 transitions. Word has length 14 [2018-06-26 21:28:37,893 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:37,893 INFO ]: Abstraction has 109 states and 1124 transitions. [2018-06-26 21:28:37,893 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:37,893 INFO ]: Start isEmpty. Operand 109 states and 1124 transitions. [2018-06-26 21:28:37,898 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 21:28:37,898 INFO ]: Found error trace [2018-06-26 21:28:37,898 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:37,898 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:37,899 INFO ]: Analyzing trace with hash 841283655, now seen corresponding path program 1 times [2018-06-26 21:28:37,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:37,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:37,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:37,899 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:37,899 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:37,917 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:37,989 INFO ]: Checked inductivity of 55 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 21:28:37,989 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:37,989 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:37,989 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:37,989 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:37,989 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:37,990 INFO ]: Start difference. First operand 109 states and 1124 transitions. Second operand 3 states. [2018-06-26 21:28:38,121 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:38,121 INFO ]: Finished difference Result 104 states and 675 transitions. [2018-06-26 21:28:38,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:38,121 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 21:28:38,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:38,122 INFO ]: With dead ends: 104 [2018-06-26 21:28:38,122 INFO ]: Without dead ends: 82 [2018-06-26 21:28:38,122 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:28:38,123 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-26 21:28:38,127 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 56. [2018-06-26 21:28:38,127 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-26 21:28:38,128 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 380 transitions. [2018-06-26 21:28:38,128 INFO ]: Start accepts. Automaton has 56 states and 380 transitions. Word has length 15 [2018-06-26 21:28:38,128 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:38,128 INFO ]: Abstraction has 56 states and 380 transitions. [2018-06-26 21:28:38,128 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:38,129 INFO ]: Start isEmpty. Operand 56 states and 380 transitions. [2018-06-26 21:28:38,129 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 21:28:38,129 INFO ]: Found error trace [2018-06-26 21:28:38,129 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:38,129 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:38,129 INFO ]: Analyzing trace with hash 711640690, now seen corresponding path program 1 times [2018-06-26 21:28:38,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:38,130 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:38,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:38,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,140 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:38,183 INFO ]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 21:28:38,183 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:38,183 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:38,183 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:38,183 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:38,183 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:38,184 INFO ]: Start difference. First operand 56 states and 380 transitions. Second operand 3 states. [2018-06-26 21:28:38,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:38,287 INFO ]: Finished difference Result 54 states and 234 transitions. [2018-06-26 21:28:38,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:38,287 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 21:28:38,287 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:38,287 INFO ]: With dead ends: 54 [2018-06-26 21:28:38,287 INFO ]: Without dead ends: 40 [2018-06-26 21:28:38,287 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:28:38,287 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 21:28:38,289 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-06-26 21:28:38,290 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 21:28:38,290 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2018-06-26 21:28:38,290 INFO ]: Start accepts. Automaton has 32 states and 147 transitions. Word has length 16 [2018-06-26 21:28:38,290 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:38,290 INFO ]: Abstraction has 32 states and 147 transitions. [2018-06-26 21:28:38,290 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:38,290 INFO ]: Start isEmpty. Operand 32 states and 147 transitions. [2018-06-26 21:28:38,291 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 21:28:38,291 INFO ]: Found error trace [2018-06-26 21:28:38,291 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:38,291 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:38,291 INFO ]: Analyzing trace with hash 737987902, now seen corresponding path program 1 times [2018-06-26 21:28:38,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:38,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:38,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,291 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:38,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:38,379 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 21:28:38,379 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:38,379 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 21:28:38,379 INFO ]: Interpolant automaton has 3 states [2018-06-26 21:28:38,379 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 21:28:38,379 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:38,380 INFO ]: Start difference. First operand 32 states and 147 transitions. Second operand 3 states. [2018-06-26 21:28:38,765 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:38,765 INFO ]: Finished difference Result 46 states and 214 transitions. [2018-06-26 21:28:38,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:28:38,766 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-26 21:28:38,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:38,766 INFO ]: With dead ends: 46 [2018-06-26 21:28:38,766 INFO ]: Without dead ends: 46 [2018-06-26 21:28:38,766 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 21:28:38,766 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 21:28:38,769 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-06-26 21:28:38,769 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 21:28:38,769 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 195 transitions. [2018-06-26 21:28:38,770 INFO ]: Start accepts. Automaton has 41 states and 195 transitions. Word has length 18 [2018-06-26 21:28:38,770 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:38,770 INFO ]: Abstraction has 41 states and 195 transitions. [2018-06-26 21:28:38,770 INFO ]: Interpolant automaton has 3 states. [2018-06-26 21:28:38,770 INFO ]: Start isEmpty. Operand 41 states and 195 transitions. [2018-06-26 21:28:38,770 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 21:28:38,770 INFO ]: Found error trace [2018-06-26 21:28:38,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:38,770 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:38,770 INFO ]: Analyzing trace with hash -1451990467, now seen corresponding path program 1 times [2018-06-26 21:28:38,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:38,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:38,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:38,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:38,789 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:38,850 INFO ]: Checked inductivity of 91 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-26 21:28:38,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 21:28:38,850 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 21:28:38,850 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:38,850 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:38,850 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:38,851 INFO ]: Start difference. First operand 41 states and 195 transitions. Second operand 4 states. [2018-06-26 21:28:39,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:39,005 INFO ]: Finished difference Result 59 states and 235 transitions. [2018-06-26 21:28:39,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:39,005 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-26 21:28:39,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:39,005 INFO ]: With dead ends: 59 [2018-06-26 21:28:39,005 INFO ]: Without dead ends: 46 [2018-06-26 21:28:39,006 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:39,006 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 21:28:39,008 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-06-26 21:28:39,008 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 21:28:39,009 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-06-26 21:28:39,009 INFO ]: Start accepts. Automaton has 35 states and 160 transitions. Word has length 18 [2018-06-26 21:28:39,009 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:39,009 INFO ]: Abstraction has 35 states and 160 transitions. [2018-06-26 21:28:39,009 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:39,009 INFO ]: Start isEmpty. Operand 35 states and 160 transitions. [2018-06-26 21:28:39,010 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 21:28:39,010 INFO ]: Found error trace [2018-06-26 21:28:39,010 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:39,010 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:39,010 INFO ]: Analyzing trace with hash 1473711399, now seen corresponding path program 1 times [2018-06-26 21:28:39,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:39,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:39,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:39,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:39,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:39,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:39,076 INFO ]: Checked inductivity of 91 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-26 21:28:39,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:39,076 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:28:39,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:39,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:39,156 INFO ]: Computing forward predicates... [2018-06-26 21:28:39,207 INFO ]: Checked inductivity of 91 backedges. 56 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 21:28:39,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:39,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:28:39,239 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:39,239 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:39,239 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:39,239 INFO ]: Start difference. First operand 35 states and 160 transitions. Second operand 4 states. [2018-06-26 21:28:41,142 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:41,142 INFO ]: Finished difference Result 54 states and 205 transitions. [2018-06-26 21:28:41,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:41,142 INFO ]: Start accepts. Automaton has 4 states. Word has length 18 [2018-06-26 21:28:41,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:41,143 INFO ]: With dead ends: 54 [2018-06-26 21:28:41,143 INFO ]: Without dead ends: 53 [2018-06-26 21:28:41,143 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:41,144 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 21:28:41,150 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-06-26 21:28:41,150 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 21:28:41,151 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 175 transitions. [2018-06-26 21:28:41,151 INFO ]: Start accepts. Automaton has 43 states and 175 transitions. Word has length 18 [2018-06-26 21:28:41,151 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:41,151 INFO ]: Abstraction has 43 states and 175 transitions. [2018-06-26 21:28:41,151 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:41,151 INFO ]: Start isEmpty. Operand 43 states and 175 transitions. [2018-06-26 21:28:41,152 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:28:41,152 INFO ]: Found error trace [2018-06-26 21:28:41,152 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:41,152 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:41,152 INFO ]: Analyzing trace with hash -774676786, now seen corresponding path program 1 times [2018-06-26 21:28:41,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:41,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:41,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:41,153 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:41,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:41,169 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:41,256 INFO ]: Checked inductivity of 153 backedges. 98 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 21:28:41,257 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:41,257 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:28:41,268 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:41,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:41,345 INFO ]: Computing forward predicates... [2018-06-26 21:28:41,371 INFO ]: Checked inductivity of 153 backedges. 98 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-26 21:28:41,405 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:41,405 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:28:41,405 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:41,406 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:41,406 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:41,406 INFO ]: Start difference. First operand 43 states and 175 transitions. Second operand 4 states. [2018-06-26 21:28:43,469 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:43,469 INFO ]: Finished difference Result 73 states and 274 transitions. [2018-06-26 21:28:43,469 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:43,469 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-26 21:28:43,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:43,470 INFO ]: With dead ends: 73 [2018-06-26 21:28:43,470 INFO ]: Without dead ends: 72 [2018-06-26 21:28:43,471 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:43,471 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 21:28:43,474 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 40. [2018-06-26 21:28:43,474 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 21:28:43,477 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 164 transitions. [2018-06-26 21:28:43,477 INFO ]: Start accepts. Automaton has 40 states and 164 transitions. Word has length 22 [2018-06-26 21:28:43,478 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:43,478 INFO ]: Abstraction has 40 states and 164 transitions. [2018-06-26 21:28:43,478 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:43,478 INFO ]: Start isEmpty. Operand 40 states and 164 transitions. [2018-06-26 21:28:43,478 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:28:43,478 INFO ]: Found error trace [2018-06-26 21:28:43,478 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:43,478 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:43,478 INFO ]: Analyzing trace with hash 1730314404, now seen corresponding path program 1 times [2018-06-26 21:28:43,478 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:43,478 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:43,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:43,479 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:43,479 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:43,505 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:43,550 INFO ]: Checked inductivity of 153 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 21:28:43,551 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:43,551 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) [2018-06-26 21:28:43,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:43,623 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:43,627 INFO ]: Computing forward predicates... [2018-06-26 21:28:43,647 INFO ]: Checked inductivity of 153 backedges. 114 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 21:28:43,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:43,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:28:43,674 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:43,674 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:43,674 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:43,674 INFO ]: Start difference. First operand 40 states and 164 transitions. Second operand 4 states. [2018-06-26 21:28:43,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:43,871 INFO ]: Finished difference Result 72 states and 280 transitions. [2018-06-26 21:28:43,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:43,872 INFO ]: Start accepts. Automaton has 4 states. Word has length 22 [2018-06-26 21:28:43,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:43,872 INFO ]: With dead ends: 72 [2018-06-26 21:28:43,872 INFO ]: Without dead ends: 72 [2018-06-26 21:28:43,872 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:43,872 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-26 21:28:43,875 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-06-26 21:28:43,875 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-26 21:28:43,875 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 204 transitions. [2018-06-26 21:28:43,875 INFO ]: Start accepts. Automaton has 52 states and 204 transitions. Word has length 22 [2018-06-26 21:28:43,875 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:43,875 INFO ]: Abstraction has 52 states and 204 transitions. [2018-06-26 21:28:43,876 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:43,876 INFO ]: Start isEmpty. Operand 52 states and 204 transitions. [2018-06-26 21:28:43,876 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 21:28:43,876 INFO ]: Found error trace [2018-06-26 21:28:43,876 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:43,876 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:43,876 INFO ]: Analyzing trace with hash 1676003691, now seen corresponding path program 1 times [2018-06-26 21:28:43,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:43,876 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:43,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:43,877 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:43,877 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:43,891 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:44,120 INFO ]: Checked inductivity of 153 backedges. 103 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-26 21:28:44,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:44,120 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:28:44,134 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:28:44,193 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:44,197 INFO ]: Computing forward predicates... [2018-06-26 21:28:44,226 INFO ]: Checked inductivity of 153 backedges. 119 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 21:28:44,259 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:44,259 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:44,260 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:44,260 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:44,260 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:44,260 INFO ]: Start difference. First operand 52 states and 204 transitions. Second operand 5 states. [2018-06-26 21:28:45,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:45,033 INFO ]: Finished difference Result 76 states and 283 transitions. [2018-06-26 21:28:45,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:45,125 INFO ]: Start accepts. Automaton has 5 states. Word has length 22 [2018-06-26 21:28:45,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:45,126 INFO ]: With dead ends: 76 [2018-06-26 21:28:45,126 INFO ]: Without dead ends: 63 [2018-06-26 21:28:45,126 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:45,126 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-26 21:28:45,129 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 43. [2018-06-26 21:28:45,129 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 21:28:45,129 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 173 transitions. [2018-06-26 21:28:45,129 INFO ]: Start accepts. Automaton has 43 states and 173 transitions. Word has length 22 [2018-06-26 21:28:45,130 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:45,130 INFO ]: Abstraction has 43 states and 173 transitions. [2018-06-26 21:28:45,130 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:45,130 INFO ]: Start isEmpty. Operand 43 states and 173 transitions. [2018-06-26 21:28:45,130 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 21:28:45,130 INFO ]: Found error trace [2018-06-26 21:28:45,130 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:45,130 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:45,131 INFO ]: Analyzing trace with hash 29337291, now seen corresponding path program 1 times [2018-06-26 21:28:45,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:45,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:45,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:45,131 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:45,131 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:45,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:45,305 INFO ]: Checked inductivity of 231 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 21:28:45,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:45,305 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) [2018-06-26 21:28:45,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:45,390 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:45,394 INFO ]: Computing forward predicates... [2018-06-26 21:28:45,411 INFO ]: Checked inductivity of 231 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 21:28:45,447 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:45,447 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 21:28:45,448 INFO ]: Interpolant automaton has 4 states [2018-06-26 21:28:45,448 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 21:28:45,448 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:45,448 INFO ]: Start difference. First operand 43 states and 173 transitions. Second operand 4 states. [2018-06-26 21:28:45,591 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:45,591 INFO ]: Finished difference Result 68 states and 273 transitions. [2018-06-26 21:28:45,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 21:28:45,591 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-26 21:28:45,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:45,592 INFO ]: With dead ends: 68 [2018-06-26 21:28:45,592 INFO ]: Without dead ends: 68 [2018-06-26 21:28:45,592 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 21:28:45,592 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 21:28:45,595 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-06-26 21:28:45,595 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-26 21:28:45,596 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 251 transitions. [2018-06-26 21:28:45,596 INFO ]: Start accepts. Automaton has 62 states and 251 transitions. Word has length 26 [2018-06-26 21:28:45,597 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:45,597 INFO ]: Abstraction has 62 states and 251 transitions. [2018-06-26 21:28:45,597 INFO ]: Interpolant automaton has 4 states. [2018-06-26 21:28:45,597 INFO ]: Start isEmpty. Operand 62 states and 251 transitions. [2018-06-26 21:28:45,598 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 21:28:45,598 INFO ]: Found error trace [2018-06-26 21:28:45,598 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:45,598 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:45,598 INFO ]: Analyzing trace with hash -363689719, now seen corresponding path program 2 times [2018-06-26 21:28:45,598 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:45,598 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:45,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:45,599 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:45,599 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:45,619 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:45,697 INFO ]: Checked inductivity of 231 backedges. 181 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 21:28:45,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:45,697 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:28:45,707 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:28:45,757 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:28:45,757 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:45,760 INFO ]: Computing forward predicates... [2018-06-26 21:28:45,773 INFO ]: Checked inductivity of 231 backedges. 181 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 21:28:45,797 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:45,797 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:45,798 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:45,798 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:45,798 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:45,798 INFO ]: Start difference. First operand 62 states and 251 transitions. Second operand 5 states. [2018-06-26 21:28:46,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:46,009 INFO ]: Finished difference Result 89 states and 323 transitions. [2018-06-26 21:28:46,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:46,010 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-26 21:28:46,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:46,010 INFO ]: With dead ends: 89 [2018-06-26 21:28:46,010 INFO ]: Without dead ends: 68 [2018-06-26 21:28:46,010 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:46,011 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 21:28:46,013 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-06-26 21:28:46,013 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-26 21:28:46,013 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 194 transitions. [2018-06-26 21:28:46,013 INFO ]: Start accepts. Automaton has 47 states and 194 transitions. Word has length 26 [2018-06-26 21:28:46,013 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:46,014 INFO ]: Abstraction has 47 states and 194 transitions. [2018-06-26 21:28:46,014 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:46,014 INFO ]: Start isEmpty. Operand 47 states and 194 transitions. [2018-06-26 21:28:46,018 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 21:28:46,018 INFO ]: Found error trace [2018-06-26 21:28:46,018 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:46,018 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:46,018 INFO ]: Analyzing trace with hash 1793877304, now seen corresponding path program 1 times [2018-06-26 21:28:46,018 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:46,018 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:46,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:46,019 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:46,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:46,039 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:46,110 INFO ]: Checked inductivity of 231 backedges. 118 proven. 59 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-06-26 21:28:46,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:46,110 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:28:46,120 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:46,174 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:46,177 INFO ]: Computing forward predicates... [2018-06-26 21:28:46,198 INFO ]: Checked inductivity of 231 backedges. 124 proven. 59 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-26 21:28:46,229 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:46,229 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:46,229 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:46,229 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:46,229 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:46,229 INFO ]: Start difference. First operand 47 states and 194 transitions. Second operand 5 states. [2018-06-26 21:28:46,511 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:46,511 INFO ]: Finished difference Result 79 states and 283 transitions. [2018-06-26 21:28:46,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:46,511 INFO ]: Start accepts. Automaton has 5 states. Word has length 26 [2018-06-26 21:28:46,512 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:46,512 INFO ]: With dead ends: 79 [2018-06-26 21:28:46,512 INFO ]: Without dead ends: 78 [2018-06-26 21:28:46,512 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:46,512 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-26 21:28:46,514 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 61. [2018-06-26 21:28:46,514 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-26 21:28:46,515 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 238 transitions. [2018-06-26 21:28:46,515 INFO ]: Start accepts. Automaton has 61 states and 238 transitions. Word has length 26 [2018-06-26 21:28:46,515 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:46,515 INFO ]: Abstraction has 61 states and 238 transitions. [2018-06-26 21:28:46,515 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:46,515 INFO ]: Start isEmpty. Operand 61 states and 238 transitions. [2018-06-26 21:28:46,516 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 21:28:46,516 INFO ]: Found error trace [2018-06-26 21:28:46,516 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:46,516 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:46,516 INFO ]: Analyzing trace with hash -2001985569, now seen corresponding path program 1 times [2018-06-26 21:28:46,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:46,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:46,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:46,517 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:46,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:46,531 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:46,782 INFO ]: Checked inductivity of 325 backedges. 198 proven. 59 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-26 21:28:46,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:46,782 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) [2018-06-26 21:28:46,797 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:46,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:46,863 INFO ]: Computing forward predicates... [2018-06-26 21:28:46,877 INFO ]: Checked inductivity of 325 backedges. 198 proven. 59 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-26 21:28:46,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:46,898 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:46,899 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:46,899 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:46,899 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:46,899 INFO ]: Start difference. First operand 61 states and 238 transitions. Second operand 5 states. [2018-06-26 21:28:47,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:47,179 INFO ]: Finished difference Result 119 states and 434 transitions. [2018-06-26 21:28:47,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:47,180 INFO ]: Start accepts. Automaton has 5 states. Word has length 30 [2018-06-26 21:28:47,180 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:47,181 INFO ]: With dead ends: 119 [2018-06-26 21:28:47,181 INFO ]: Without dead ends: 118 [2018-06-26 21:28:47,181 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:47,181 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-26 21:28:47,185 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 51. [2018-06-26 21:28:47,185 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-26 21:28:47,186 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 204 transitions. [2018-06-26 21:28:47,186 INFO ]: Start accepts. Automaton has 51 states and 204 transitions. Word has length 30 [2018-06-26 21:28:47,186 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:47,186 INFO ]: Abstraction has 51 states and 204 transitions. [2018-06-26 21:28:47,186 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:47,186 INFO ]: Start isEmpty. Operand 51 states and 204 transitions. [2018-06-26 21:28:47,186 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 21:28:47,186 INFO ]: Found error trace [2018-06-26 21:28:47,186 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:47,187 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:47,187 INFO ]: Analyzing trace with hash -1061459915, now seen corresponding path program 2 times [2018-06-26 21:28:47,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:47,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:47,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:47,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:47,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:47,207 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:47,279 INFO ]: Checked inductivity of 325 backedges. 202 proven. 59 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-06-26 21:28:47,279 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:47,279 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:47,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:28:47,344 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:28:47,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:47,347 INFO ]: Computing forward predicates... [2018-06-26 21:28:47,359 INFO ]: Checked inductivity of 325 backedges. 230 proven. 33 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-06-26 21:28:47,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:47,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:47,379 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:47,379 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:47,379 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:47,379 INFO ]: Start difference. First operand 51 states and 204 transitions. Second operand 5 states. [2018-06-26 21:28:47,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:47,565 INFO ]: Finished difference Result 108 states and 411 transitions. [2018-06-26 21:28:47,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:47,565 INFO ]: Start accepts. Automaton has 5 states. Word has length 30 [2018-06-26 21:28:47,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:47,566 INFO ]: With dead ends: 108 [2018-06-26 21:28:47,566 INFO ]: Without dead ends: 108 [2018-06-26 21:28:47,566 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:47,566 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-26 21:28:47,569 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 71. [2018-06-26 21:28:47,569 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 21:28:47,570 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 266 transitions. [2018-06-26 21:28:47,570 INFO ]: Start accepts. Automaton has 71 states and 266 transitions. Word has length 30 [2018-06-26 21:28:47,570 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:47,570 INFO ]: Abstraction has 71 states and 266 transitions. [2018-06-26 21:28:47,570 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:47,570 INFO ]: Start isEmpty. Operand 71 states and 266 transitions. [2018-06-26 21:28:47,571 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 21:28:47,571 INFO ]: Found error trace [2018-06-26 21:28:47,571 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:47,571 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:47,571 INFO ]: Analyzing trace with hash -1115770628, now seen corresponding path program 1 times [2018-06-26 21:28:47,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:47,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:47,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:47,571 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:47,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:47,586 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:47,703 INFO ]: Checked inductivity of 325 backedges. 203 proven. 59 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-26 21:28:47,703 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:47,703 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:47,709 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:47,764 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:47,767 INFO ]: Computing forward predicates... [2018-06-26 21:28:47,783 INFO ]: Checked inductivity of 325 backedges. 235 proven. 33 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-26 21:28:47,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:47,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:47,804 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:47,804 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:47,804 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:47,804 INFO ]: Start difference. First operand 71 states and 266 transitions. Second operand 6 states. [2018-06-26 21:28:48,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:48,059 INFO ]: Finished difference Result 112 states and 414 transitions. [2018-06-26 21:28:48,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:48,059 INFO ]: Start accepts. Automaton has 6 states. Word has length 30 [2018-06-26 21:28:48,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:48,060 INFO ]: With dead ends: 112 [2018-06-26 21:28:48,060 INFO ]: Without dead ends: 95 [2018-06-26 21:28:48,060 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:48,060 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-26 21:28:48,062 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 55. [2018-06-26 21:28:48,062 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-26 21:28:48,062 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 216 transitions. [2018-06-26 21:28:48,062 INFO ]: Start accepts. Automaton has 55 states and 216 transitions. Word has length 30 [2018-06-26 21:28:48,062 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:48,062 INFO ]: Abstraction has 55 states and 216 transitions. [2018-06-26 21:28:48,062 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:48,062 INFO ]: Start isEmpty. Operand 55 states and 216 transitions. [2018-06-26 21:28:48,063 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 21:28:48,063 INFO ]: Found error trace [2018-06-26 21:28:48,063 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:48,063 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:48,063 INFO ]: Analyzing trace with hash 759134044, now seen corresponding path program 2 times [2018-06-26 21:28:48,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:48,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:48,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:48,064 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:48,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:48,079 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:48,270 INFO ]: Checked inductivity of 435 backedges. 319 proven. 33 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 21:28:48,271 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:48,271 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:48,276 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:28:48,344 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:28:48,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:48,347 INFO ]: Computing forward predicates... [2018-06-26 21:28:48,360 INFO ]: Checked inductivity of 435 backedges. 319 proven. 33 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-26 21:28:48,402 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:48,402 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 21:28:48,402 INFO ]: Interpolant automaton has 5 states [2018-06-26 21:28:48,402 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 21:28:48,402 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:48,402 INFO ]: Start difference. First operand 55 states and 216 transitions. Second operand 5 states. [2018-06-26 21:28:48,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:48,595 INFO ]: Finished difference Result 95 states and 368 transitions. [2018-06-26 21:28:48,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 21:28:48,595 INFO ]: Start accepts. Automaton has 5 states. Word has length 34 [2018-06-26 21:28:48,595 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:48,596 INFO ]: With dead ends: 95 [2018-06-26 21:28:48,596 INFO ]: Without dead ends: 95 [2018-06-26 21:28:48,596 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 21:28:48,596 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-26 21:28:48,599 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-06-26 21:28:48,599 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-26 21:28:48,599 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 337 transitions. [2018-06-26 21:28:48,599 INFO ]: Start accepts. Automaton has 86 states and 337 transitions. Word has length 34 [2018-06-26 21:28:48,599 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:48,599 INFO ]: Abstraction has 86 states and 337 transitions. [2018-06-26 21:28:48,599 INFO ]: Interpolant automaton has 5 states. [2018-06-26 21:28:48,599 INFO ]: Start isEmpty. Operand 86 states and 337 transitions. [2018-06-26 21:28:48,600 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 21:28:48,600 INFO ]: Found error trace [2018-06-26 21:28:48,600 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:48,600 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:48,600 INFO ]: Analyzing trace with hash 366107034, now seen corresponding path program 3 times [2018-06-26 21:28:48,600 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:48,600 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:48,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:48,601 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:48,601 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:48,614 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:48,934 INFO ]: Checked inductivity of 435 backedges. 329 proven. 33 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 21:28:48,934 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:48,934 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:28:48,948 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:49,152 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-26 21:28:49,153 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:49,155 INFO ]: Computing forward predicates... [2018-06-26 21:28:49,169 INFO ]: Checked inductivity of 435 backedges. 329 proven. 33 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-26 21:28:49,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:49,196 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:49,196 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:49,196 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:49,196 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:49,196 INFO ]: Start difference. First operand 86 states and 337 transitions. Second operand 6 states. [2018-06-26 21:28:49,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:49,536 INFO ]: Finished difference Result 121 states and 431 transitions. [2018-06-26 21:28:49,536 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:49,536 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 21:28:49,536 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:49,537 INFO ]: With dead ends: 121 [2018-06-26 21:28:49,537 INFO ]: Without dead ends: 92 [2018-06-26 21:28:49,537 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:49,537 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-26 21:28:49,541 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 59. [2018-06-26 21:28:49,541 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-26 21:28:49,541 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 237 transitions. [2018-06-26 21:28:49,541 INFO ]: Start accepts. Automaton has 59 states and 237 transitions. Word has length 34 [2018-06-26 21:28:49,542 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:49,542 INFO ]: Abstraction has 59 states and 237 transitions. [2018-06-26 21:28:49,542 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:49,542 INFO ]: Start isEmpty. Operand 59 states and 237 transitions. [2018-06-26 21:28:49,542 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 21:28:49,542 INFO ]: Found error trace [2018-06-26 21:28:49,542 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:49,542 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:49,542 INFO ]: Analyzing trace with hash -1779337015, now seen corresponding path program 3 times [2018-06-26 21:28:49,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:49,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:49,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:49,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:49,560 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:49,700 INFO ]: Checked inductivity of 435 backedges. 218 proven. 135 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-26 21:28:49,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:49,700 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:49,718 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:28:49,796 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-06-26 21:28:49,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:49,800 INFO ]: Computing forward predicates... [2018-06-26 21:28:49,816 INFO ]: Checked inductivity of 435 backedges. 218 proven. 135 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-06-26 21:28:49,849 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:49,849 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:49,849 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:49,849 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:49,849 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:49,849 INFO ]: Start difference. First operand 59 states and 237 transitions. Second operand 6 states. [2018-06-26 21:28:50,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:50,081 INFO ]: Finished difference Result 116 states and 397 transitions. [2018-06-26 21:28:50,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:50,081 INFO ]: Start accepts. Automaton has 6 states. Word has length 34 [2018-06-26 21:28:50,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:50,082 INFO ]: With dead ends: 116 [2018-06-26 21:28:50,082 INFO ]: Without dead ends: 115 [2018-06-26 21:28:50,083 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:50,083 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-26 21:28:50,085 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 84. [2018-06-26 21:28:50,085 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-26 21:28:50,086 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 316 transitions. [2018-06-26 21:28:50,086 INFO ]: Start accepts. Automaton has 84 states and 316 transitions. Word has length 34 [2018-06-26 21:28:50,086 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:50,086 INFO ]: Abstraction has 84 states and 316 transitions. [2018-06-26 21:28:50,086 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:50,086 INFO ]: Start isEmpty. Operand 84 states and 316 transitions. [2018-06-26 21:28:50,087 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 21:28:50,087 INFO ]: Found error trace [2018-06-26 21:28:50,087 INFO ]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:50,087 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:50,087 INFO ]: Analyzing trace with hash -168059792, now seen corresponding path program 4 times [2018-06-26 21:28:50,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:50,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:50,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:50,088 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:50,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:50,104 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:50,472 INFO ]: Checked inductivity of 561 backedges. 330 proven. 135 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-26 21:28:50,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:50,472 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:50,478 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 21:28:50,547 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:28:50,547 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:50,551 INFO ]: Computing forward predicates... [2018-06-26 21:28:50,564 INFO ]: Checked inductivity of 561 backedges. 330 proven. 135 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-06-26 21:28:50,584 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:50,584 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:50,584 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:50,584 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:50,584 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:50,584 INFO ]: Start difference. First operand 84 states and 316 transitions. Second operand 6 states. [2018-06-26 21:28:50,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:50,832 INFO ]: Finished difference Result 182 states and 653 transitions. [2018-06-26 21:28:50,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:50,832 INFO ]: Start accepts. Automaton has 6 states. Word has length 38 [2018-06-26 21:28:50,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:50,833 INFO ]: With dead ends: 182 [2018-06-26 21:28:50,833 INFO ]: Without dead ends: 181 [2018-06-26 21:28:50,833 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:50,833 INFO ]: Start minimizeSevpa. Operand 181 states. [2018-06-26 21:28:50,835 INFO ]: Finished minimizeSevpa. Reduced states from 181 to 63. [2018-06-26 21:28:50,835 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-26 21:28:50,835 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 247 transitions. [2018-06-26 21:28:50,835 INFO ]: Start accepts. Automaton has 63 states and 247 transitions. Word has length 38 [2018-06-26 21:28:50,835 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:50,835 INFO ]: Abstraction has 63 states and 247 transitions. [2018-06-26 21:28:50,835 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:50,835 INFO ]: Start isEmpty. Operand 63 states and 247 transitions. [2018-06-26 21:28:50,836 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 21:28:50,836 INFO ]: Found error trace [2018-06-26 21:28:50,836 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:50,836 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:50,836 INFO ]: Analyzing trace with hash -184923322, now seen corresponding path program 4 times [2018-06-26 21:28:50,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:50,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:50,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:50,836 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:50,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:50,851 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:50,974 INFO ]: Checked inductivity of 561 backedges. 334 proven. 135 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-06-26 21:28:50,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:50,974 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:50,980 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 21:28:51,053 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:28:51,053 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:51,056 INFO ]: Computing forward predicates... [2018-06-26 21:28:51,071 INFO ]: Checked inductivity of 561 backedges. 378 proven. 93 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-26 21:28:51,103 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:51,103 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:51,103 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:51,103 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:51,103 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:51,103 INFO ]: Start difference. First operand 63 states and 247 transitions. Second operand 6 states. [2018-06-26 21:28:51,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:51,375 INFO ]: Finished difference Result 154 states and 581 transitions. [2018-06-26 21:28:51,377 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:51,377 INFO ]: Start accepts. Automaton has 6 states. Word has length 38 [2018-06-26 21:28:51,377 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:51,378 INFO ]: With dead ends: 154 [2018-06-26 21:28:51,378 INFO ]: Without dead ends: 154 [2018-06-26 21:28:51,378 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:51,378 INFO ]: Start minimizeSevpa. Operand 154 states. [2018-06-26 21:28:51,381 INFO ]: Finished minimizeSevpa. Reduced states from 154 to 91. [2018-06-26 21:28:51,381 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-26 21:28:51,382 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 331 transitions. [2018-06-26 21:28:51,382 INFO ]: Start accepts. Automaton has 91 states and 331 transitions. Word has length 38 [2018-06-26 21:28:51,382 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:51,382 INFO ]: Abstraction has 91 states and 331 transitions. [2018-06-26 21:28:51,382 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:51,382 INFO ]: Start isEmpty. Operand 91 states and 331 transitions. [2018-06-26 21:28:51,383 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 21:28:51,383 INFO ]: Found error trace [2018-06-26 21:28:51,383 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:51,383 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:51,383 INFO ]: Analyzing trace with hash -239234035, now seen corresponding path program 2 times [2018-06-26 21:28:51,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:51,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:51,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:51,383 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:51,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:51,400 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:51,541 INFO ]: Checked inductivity of 561 backedges. 335 proven. 135 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-26 21:28:51,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:51,541 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:51,548 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:28:51,646 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:28:51,646 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:51,649 INFO ]: Computing forward predicates... [2018-06-26 21:28:51,671 INFO ]: Checked inductivity of 561 backedges. 383 proven. 93 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-26 21:28:51,691 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:51,692 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:28:51,692 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:28:51,692 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:28:51,692 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:51,692 INFO ]: Start difference. First operand 91 states and 331 transitions. Second operand 7 states. [2018-06-26 21:28:51,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:51,955 INFO ]: Finished difference Result 158 states and 584 transitions. [2018-06-26 21:28:51,955 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:28:51,955 INFO ]: Start accepts. Automaton has 7 states. Word has length 38 [2018-06-26 21:28:51,955 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:51,956 INFO ]: With dead ends: 158 [2018-06-26 21:28:51,956 INFO ]: Without dead ends: 137 [2018-06-26 21:28:51,956 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:51,957 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-26 21:28:51,959 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 67. [2018-06-26 21:28:51,959 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-26 21:28:51,960 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 259 transitions. [2018-06-26 21:28:51,960 INFO ]: Start accepts. Automaton has 67 states and 259 transitions. Word has length 38 [2018-06-26 21:28:51,960 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:51,960 INFO ]: Abstraction has 67 states and 259 transitions. [2018-06-26 21:28:51,960 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:28:51,960 INFO ]: Start isEmpty. Operand 67 states and 259 transitions. [2018-06-26 21:28:51,960 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 21:28:51,960 INFO ]: Found error trace [2018-06-26 21:28:51,960 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:51,961 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:51,961 INFO ]: Analyzing trace with hash 913064813, now seen corresponding path program 5 times [2018-06-26 21:28:51,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:51,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:51,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:51,961 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:51,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:51,976 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:52,331 INFO ]: Checked inductivity of 703 backedges. 499 proven. 93 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-26 21:28:52,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:52,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:28:52,343 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:52,571 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 21:28:52,571 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:52,575 INFO ]: Computing forward predicates... [2018-06-26 21:28:52,588 INFO ]: Checked inductivity of 703 backedges. 499 proven. 93 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-26 21:28:52,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:52,620 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-26 21:28:52,620 INFO ]: Interpolant automaton has 6 states [2018-06-26 21:28:52,620 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 21:28:52,620 INFO ]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:52,620 INFO ]: Start difference. First operand 67 states and 259 transitions. Second operand 6 states. [2018-06-26 21:28:53,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:53,133 INFO ]: Finished difference Result 123 states and 466 transitions. [2018-06-26 21:28:53,133 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 21:28:53,133 INFO ]: Start accepts. Automaton has 6 states. Word has length 42 [2018-06-26 21:28:53,133 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:53,134 INFO ]: With dead ends: 123 [2018-06-26 21:28:53,134 INFO ]: Without dead ends: 123 [2018-06-26 21:28:53,135 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-06-26 21:28:53,135 INFO ]: Start minimizeSevpa. Operand 123 states. [2018-06-26 21:28:53,138 INFO ]: Finished minimizeSevpa. Reduced states from 123 to 110. [2018-06-26 21:28:53,138 INFO ]: Start removeUnreachable. Operand 110 states. [2018-06-26 21:28:53,139 INFO ]: Finished removeUnreachable. Reduced from 110 states to 110 states and 423 transitions. [2018-06-26 21:28:53,139 INFO ]: Start accepts. Automaton has 110 states and 423 transitions. Word has length 42 [2018-06-26 21:28:53,139 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:53,139 INFO ]: Abstraction has 110 states and 423 transitions. [2018-06-26 21:28:53,139 INFO ]: Interpolant automaton has 6 states. [2018-06-26 21:28:53,139 INFO ]: Start isEmpty. Operand 110 states and 423 transitions. [2018-06-26 21:28:53,140 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 21:28:53,140 INFO ]: Found error trace [2018-06-26 21:28:53,140 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:53,140 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:53,140 INFO ]: Analyzing trace with hash 520037803, now seen corresponding path program 6 times [2018-06-26 21:28:53,140 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:53,140 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:53,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:53,141 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:53,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:53,157 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:53,602 INFO ]: Checked inductivity of 703 backedges. 509 proven. 93 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-26 21:28:53,602 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:53,602 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 21:28:53,619 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:53,947 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-06-26 21:28:53,947 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:53,952 INFO ]: Computing forward predicates... [2018-06-26 21:28:53,969 INFO ]: Checked inductivity of 703 backedges. 509 proven. 93 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-26 21:28:53,995 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:53,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:28:53,995 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:28:53,996 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:28:53,996 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:53,996 INFO ]: Start difference. First operand 110 states and 423 transitions. Second operand 7 states. [2018-06-26 21:28:54,283 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:54,283 INFO ]: Finished difference Result 153 states and 539 transitions. [2018-06-26 21:28:54,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:28:54,284 INFO ]: Start accepts. Automaton has 7 states. Word has length 42 [2018-06-26 21:28:54,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:54,284 INFO ]: With dead ends: 153 [2018-06-26 21:28:54,284 INFO ]: Without dead ends: 116 [2018-06-26 21:28:54,284 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:54,285 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-26 21:28:54,287 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 71. [2018-06-26 21:28:54,287 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-26 21:28:54,288 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 280 transitions. [2018-06-26 21:28:54,288 INFO ]: Start accepts. Automaton has 71 states and 280 transitions. Word has length 42 [2018-06-26 21:28:54,288 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:54,288 INFO ]: Abstraction has 71 states and 280 transitions. [2018-06-26 21:28:54,288 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:28:54,288 INFO ]: Start isEmpty. Operand 71 states and 280 transitions. [2018-06-26 21:28:54,288 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 21:28:54,288 INFO ]: Found error trace [2018-06-26 21:28:54,288 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:54,288 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:54,289 INFO ]: Analyzing trace with hash 850429914, now seen corresponding path program 5 times [2018-06-26 21:28:54,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:54,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:54,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:54,289 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:54,289 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:54,305 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:54,494 INFO ]: Checked inductivity of 703 backedges. 350 proven. 243 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-06-26 21:28:54,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:54,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:54,500 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 21:28:54,589 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-06-26 21:28:54,589 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:54,593 INFO ]: Computing forward predicates... [2018-06-26 21:28:54,618 INFO ]: Checked inductivity of 703 backedges. 356 proven. 243 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-06-26 21:28:54,650 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:54,650 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:28:54,651 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:28:54,651 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:28:54,651 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:54,651 INFO ]: Start difference. First operand 71 states and 280 transitions. Second operand 7 states. [2018-06-26 21:28:54,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:54,884 INFO ]: Finished difference Result 161 states and 533 transitions. [2018-06-26 21:28:54,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:28:54,884 INFO ]: Start accepts. Automaton has 7 states. Word has length 42 [2018-06-26 21:28:54,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:54,885 INFO ]: With dead ends: 161 [2018-06-26 21:28:54,885 INFO ]: Without dead ends: 160 [2018-06-26 21:28:54,885 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:54,885 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-26 21:28:54,888 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 111. [2018-06-26 21:28:54,888 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-26 21:28:54,889 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 406 transitions. [2018-06-26 21:28:54,889 INFO ]: Start accepts. Automaton has 111 states and 406 transitions. Word has length 42 [2018-06-26 21:28:54,889 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:54,889 INFO ]: Abstraction has 111 states and 406 transitions. [2018-06-26 21:28:54,889 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:28:54,889 INFO ]: Start isEmpty. Operand 111 states and 406 transitions. [2018-06-26 21:28:54,890 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 21:28:54,890 INFO ]: Found error trace [2018-06-26 21:28:54,890 INFO ]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:54,890 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:54,890 INFO ]: Analyzing trace with hash -57928575, now seen corresponding path program 7 times [2018-06-26 21:28:54,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:54,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:54,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:54,891 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:54,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:54,906 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:55,100 INFO ]: Checked inductivity of 861 backedges. 494 proven. 243 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 21:28:55,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:55,129 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:55,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:55,221 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:55,226 INFO ]: Computing forward predicates... [2018-06-26 21:28:55,245 INFO ]: Checked inductivity of 861 backedges. 494 proven. 243 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-06-26 21:28:55,272 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:55,272 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:28:55,273 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:28:55,273 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:28:55,273 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:55,273 INFO ]: Start difference. First operand 111 states and 406 transitions. Second operand 7 states. [2018-06-26 21:28:55,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:55,557 INFO ]: Finished difference Result 266 states and 943 transitions. [2018-06-26 21:28:55,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:28:55,558 INFO ]: Start accepts. Automaton has 7 states. Word has length 46 [2018-06-26 21:28:55,558 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:55,559 INFO ]: With dead ends: 266 [2018-06-26 21:28:55,559 INFO ]: Without dead ends: 265 [2018-06-26 21:28:55,559 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:55,559 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-26 21:28:55,563 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 75. [2018-06-26 21:28:55,563 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 21:28:55,564 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 290 transitions. [2018-06-26 21:28:55,564 INFO ]: Start accepts. Automaton has 75 states and 290 transitions. Word has length 46 [2018-06-26 21:28:55,564 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:55,564 INFO ]: Abstraction has 75 states and 290 transitions. [2018-06-26 21:28:55,564 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:28:55,564 INFO ]: Start isEmpty. Operand 75 states and 290 transitions. [2018-06-26 21:28:55,565 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-26 21:28:55,565 INFO ]: Found error trace [2018-06-26 21:28:55,565 INFO ]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:55,565 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:55,565 INFO ]: Analyzing trace with hash -292984361, now seen corresponding path program 6 times [2018-06-26 21:28:55,565 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:55,565 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:55,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:55,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:28:55,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:55,583 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:55,727 INFO ]: Checked inductivity of 861 backedges. 498 proven. 243 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-06-26 21:28:55,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:55,727 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:55,733 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 21:28:55,864 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-06-26 21:28:55,864 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:55,868 INFO ]: Computing forward predicates... [2018-06-26 21:28:55,915 INFO ]: Checked inductivity of 861 backedges. 563 proven. 185 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-26 21:28:55,934 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:55,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-06-26 21:28:55,935 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:28:55,935 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:28:55,935 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:28:55,935 INFO ]: Start difference. First operand 75 states and 290 transitions. Second operand 8 states. [2018-06-26 21:28:56,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:56,299 INFO ]: Finished difference Result 212 states and 787 transitions. [2018-06-26 21:28:56,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:28:56,299 INFO ]: Start accepts. Automaton has 8 states. Word has length 46 [2018-06-26 21:28:56,299 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:56,300 INFO ]: With dead ends: 212 [2018-06-26 21:28:56,300 INFO ]: Without dead ends: 187 [2018-06-26 21:28:56,300 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:28:56,300 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-26 21:28:56,304 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 79. [2018-06-26 21:28:56,304 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-26 21:28:56,304 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 302 transitions. [2018-06-26 21:28:56,304 INFO ]: Start accepts. Automaton has 79 states and 302 transitions. Word has length 46 [2018-06-26 21:28:56,305 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:56,305 INFO ]: Abstraction has 79 states and 302 transitions. [2018-06-26 21:28:56,305 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:28:56,305 INFO ]: Start isEmpty. Operand 79 states and 302 transitions. [2018-06-26 21:28:56,305 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 21:28:56,305 INFO ]: Found error trace [2018-06-26 21:28:56,305 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:56,305 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:56,305 INFO ]: Analyzing trace with hash 284183294, now seen corresponding path program 8 times [2018-06-26 21:28:56,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:56,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:56,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:56,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:56,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:56,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:56,734 INFO ]: Checked inductivity of 1035 backedges. 711 proven. 185 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-26 21:28:56,734 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:56,734 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:56,739 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:28:56,830 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:28:56,830 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:56,834 INFO ]: Computing forward predicates... [2018-06-26 21:28:56,852 INFO ]: Checked inductivity of 1035 backedges. 711 proven. 185 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-06-26 21:28:56,884 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:56,884 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 21:28:56,885 INFO ]: Interpolant automaton has 7 states [2018-06-26 21:28:56,885 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 21:28:56,885 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:56,885 INFO ]: Start difference. First operand 79 states and 302 transitions. Second operand 7 states. [2018-06-26 21:28:58,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:28:58,833 INFO ]: Finished difference Result 151 states and 564 transitions. [2018-06-26 21:28:58,834 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 21:28:58,834 INFO ]: Start accepts. Automaton has 7 states. Word has length 50 [2018-06-26 21:28:58,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:28:58,835 INFO ]: With dead ends: 151 [2018-06-26 21:28:58,835 INFO ]: Without dead ends: 151 [2018-06-26 21:28:58,835 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 21:28:58,835 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 21:28:58,839 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-06-26 21:28:58,839 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-26 21:28:58,840 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 509 transitions. [2018-06-26 21:28:58,840 INFO ]: Start accepts. Automaton has 134 states and 509 transitions. Word has length 50 [2018-06-26 21:28:58,840 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:28:58,840 INFO ]: Abstraction has 134 states and 509 transitions. [2018-06-26 21:28:58,840 INFO ]: Interpolant automaton has 7 states. [2018-06-26 21:28:58,840 INFO ]: Start isEmpty. Operand 134 states and 509 transitions. [2018-06-26 21:28:58,841 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 21:28:58,841 INFO ]: Found error trace [2018-06-26 21:28:58,841 INFO ]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:28:58,841 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:28:58,841 INFO ]: Analyzing trace with hash -108843716, now seen corresponding path program 9 times [2018-06-26 21:28:58,841 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:28:58,841 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:28:58,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:58,842 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:28:58,842 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:28:58,860 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:59,451 INFO ]: Checked inductivity of 1035 backedges. 721 proven. 185 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-26 21:28:59,451 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:28:59,451 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:28:59,460 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:28:59,697 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-06-26 21:28:59,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:28:59,701 INFO ]: Computing forward predicates... [2018-06-26 21:28:59,724 INFO ]: Checked inductivity of 1035 backedges. 721 proven. 185 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-06-26 21:28:59,748 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:28:59,748 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 21:28:59,748 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:28:59,748 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:28:59,748 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:28:59,748 INFO ]: Start difference. First operand 134 states and 509 transitions. Second operand 8 states. [2018-06-26 21:29:00,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:29:00,266 INFO ]: Finished difference Result 185 states and 647 transitions. [2018-06-26 21:29:00,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:29:00,297 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-26 21:29:00,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:29:00,297 INFO ]: With dead ends: 185 [2018-06-26 21:29:00,297 INFO ]: Without dead ends: 140 [2018-06-26 21:29:00,298 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:00,298 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-26 21:29:00,300 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 83. [2018-06-26 21:29:00,300 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-26 21:29:00,301 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 323 transitions. [2018-06-26 21:29:00,301 INFO ]: Start accepts. Automaton has 83 states and 323 transitions. Word has length 50 [2018-06-26 21:29:00,301 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:29:00,301 INFO ]: Abstraction has 83 states and 323 transitions. [2018-06-26 21:29:00,301 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:29:00,301 INFO ]: Start isEmpty. Operand 83 states and 323 transitions. [2018-06-26 21:29:00,302 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 21:29:00,302 INFO ]: Found error trace [2018-06-26 21:29:00,302 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:29:00,302 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:29:00,302 INFO ]: Analyzing trace with hash -673983893, now seen corresponding path program 7 times [2018-06-26 21:29:00,302 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:29:00,302 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:29:00,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:00,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:29:00,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:00,320 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:00,502 INFO ]: Checked inductivity of 1035 backedges. 514 proven. 383 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-06-26 21:29:00,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:29:00,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:29:00,508 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:29:00,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:00,616 INFO ]: Computing forward predicates... [2018-06-26 21:29:00,639 INFO ]: Checked inductivity of 1035 backedges. 520 proven. 383 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-06-26 21:29:00,671 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:29:00,671 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 21:29:00,671 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:29:00,671 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:29:00,671 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:00,671 INFO ]: Start difference. First operand 83 states and 323 transitions. Second operand 8 states. [2018-06-26 21:29:01,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:29:01,125 INFO ]: Finished difference Result 214 states and 691 transitions. [2018-06-26 21:29:01,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:29:01,125 INFO ]: Start accepts. Automaton has 8 states. Word has length 50 [2018-06-26 21:29:01,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:29:01,126 INFO ]: With dead ends: 214 [2018-06-26 21:29:01,126 INFO ]: Without dead ends: 213 [2018-06-26 21:29:01,126 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:01,126 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-26 21:29:01,129 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 142. [2018-06-26 21:29:01,129 INFO ]: Start removeUnreachable. Operand 142 states. [2018-06-26 21:29:01,130 INFO ]: Finished removeUnreachable. Reduced from 142 states to 142 states and 508 transitions. [2018-06-26 21:29:01,130 INFO ]: Start accepts. Automaton has 142 states and 508 transitions. Word has length 50 [2018-06-26 21:29:01,130 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:29:01,130 INFO ]: Abstraction has 142 states and 508 transitions. [2018-06-26 21:29:01,130 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:29:01,130 INFO ]: Start isEmpty. Operand 142 states and 508 transitions. [2018-06-26 21:29:01,131 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 21:29:01,131 INFO ]: Found error trace [2018-06-26 21:29:01,131 INFO ]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:29:01,131 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:29:01,131 INFO ]: Analyzing trace with hash -1140340718, now seen corresponding path program 10 times [2018-06-26 21:29:01,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:29:01,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:29:01,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:01,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 21:29:01,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:01,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:01,736 INFO ]: Checked inductivity of 1225 backedges. 690 proven. 383 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-26 21:29:01,736 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:29:01,736 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:29:01,743 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 21:29:01,857 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 21:29:01,857 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:01,861 INFO ]: Computing forward predicates... [2018-06-26 21:29:01,885 INFO ]: Checked inductivity of 1225 backedges. 690 proven. 383 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-06-26 21:29:01,906 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:29:01,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 21:29:01,906 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:29:01,906 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:29:01,906 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:01,906 INFO ]: Start difference. First operand 142 states and 508 transitions. Second operand 8 states. [2018-06-26 21:29:02,388 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:29:02,388 INFO ]: Finished difference Result 375 states and 1316 transitions. [2018-06-26 21:29:02,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:29:02,388 INFO ]: Start accepts. Automaton has 8 states. Word has length 54 [2018-06-26 21:29:02,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:29:02,391 INFO ]: With dead ends: 375 [2018-06-26 21:29:02,391 INFO ]: Without dead ends: 374 [2018-06-26 21:29:02,391 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:02,391 INFO ]: Start minimizeSevpa. Operand 374 states. [2018-06-26 21:29:02,396 INFO ]: Finished minimizeSevpa. Reduced states from 374 to 87. [2018-06-26 21:29:02,396 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-26 21:29:02,396 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 333 transitions. [2018-06-26 21:29:02,396 INFO ]: Start accepts. Automaton has 87 states and 333 transitions. Word has length 54 [2018-06-26 21:29:02,397 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:29:02,397 INFO ]: Abstraction has 87 states and 333 transitions. [2018-06-26 21:29:02,397 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:29:02,397 INFO ]: Start isEmpty. Operand 87 states and 333 transitions. [2018-06-26 21:29:02,397 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 21:29:02,397 INFO ]: Found error trace [2018-06-26 21:29:02,397 INFO ]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:29:02,397 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:29:02,398 INFO ]: Analyzing trace with hash 1693647848, now seen corresponding path program 8 times [2018-06-26 21:29:02,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:29:02,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:29:02,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:02,399 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:29:02,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:02,419 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:02,592 INFO ]: Checked inductivity of 1225 backedges. 694 proven. 383 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-06-26 21:29:02,592 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:29:02,592 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:29:02,598 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 21:29:02,701 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 21:29:02,701 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:02,705 INFO ]: Computing forward predicates... [2018-06-26 21:29:02,723 INFO ]: Checked inductivity of 1225 backedges. 770 proven. 309 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-06-26 21:29:02,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:29:02,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 21:29:02,756 INFO ]: Interpolant automaton has 8 states [2018-06-26 21:29:02,756 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 21:29:02,756 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:02,756 INFO ]: Start difference. First operand 87 states and 333 transitions. Second operand 8 states. [2018-06-26 21:29:03,079 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 21:29:03,079 INFO ]: Finished difference Result 270 states and 1020 transitions. [2018-06-26 21:29:03,079 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 21:29:03,079 INFO ]: Start accepts. Automaton has 8 states. Word has length 54 [2018-06-26 21:29:03,079 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 21:29:03,080 INFO ]: With dead ends: 270 [2018-06-26 21:29:03,080 INFO ]: Without dead ends: 270 [2018-06-26 21:29:03,080 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 21:29:03,080 INFO ]: Start minimizeSevpa. Operand 270 states. [2018-06-26 21:29:03,085 INFO ]: Finished minimizeSevpa. Reduced states from 270 to 131. [2018-06-26 21:29:03,085 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-26 21:29:03,085 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 461 transitions. [2018-06-26 21:29:03,085 INFO ]: Start accepts. Automaton has 131 states and 461 transitions. Word has length 54 [2018-06-26 21:29:03,086 INFO ]: Finished accepts. word is rejected. [2018-06-26 21:29:03,086 INFO ]: Abstraction has 131 states and 461 transitions. [2018-06-26 21:29:03,086 INFO ]: Interpolant automaton has 8 states. [2018-06-26 21:29:03,086 INFO ]: Start isEmpty. Operand 131 states and 461 transitions. [2018-06-26 21:29:03,086 INFO ]: Finished isEmpty. Found accepting run of length 55 [2018-06-26 21:29:03,086 INFO ]: Found error trace [2018-06-26 21:29:03,086 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 21:29:03,086 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 21:29:03,086 INFO ]: Analyzing trace with hash 1639337135, now seen corresponding path program 3 times [2018-06-26 21:29:03,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 21:29:03,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 21:29:03,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:03,087 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 21:29:03,087 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 21:29:03,104 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:03,294 INFO ]: Checked inductivity of 1225 backedges. 695 proven. 383 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-06-26 21:29:03,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 21:29:03,294 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 21:29:03,301 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 21:29:03,438 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-06-26 21:29:03,438 INFO ]: Conjunction of SSA is unsat [2018-06-26 21:29:03,443 INFO ]: Computing forward predicates... [2018-06-26 21:29:03,469 INFO ]: Checked inductivity of 1225 backedges. 775 proven. 309 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-06-26 21:29:03,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 21:29:03,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 21:29:03,502 INFO ]: Interpolant automaton has 9 states [2018-06-26 21:29:03,502 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 21:29:03,502 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 21:29:03,502 INFO ]: Start difference. First operand 131 states and 461 transitions. Second operand 9 states. Received shutdown request... [2018-06-26 21:29:04,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 21:29:04,698 WARN ]: Verification canceled [2018-06-26 21:29:04,701 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 21:29:04,703 WARN ]: Timeout [2018-06-26 21:29:04,703 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 09:29:04 BasicIcfg [2018-06-26 21:29:04,703 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 21:29:04,704 INFO ]: Toolchain (without parser) took 50450.89 ms. Allocated memory was 307.8 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 263.2 MB in the beginning and 883.3 MB in the end (delta: -620.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 3.6 GB. [2018-06-26 21:29:04,705 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 21:29:04,705 INFO ]: ChcToBoogie took 62.15 ms. Allocated memory is still 307.8 MB. Free memory was 262.2 MB in the beginning and 260.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:29:04,706 INFO ]: Boogie Preprocessor took 43.53 ms. Allocated memory is still 307.8 MB. Free memory was 260.3 MB in the beginning and 259.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 21:29:04,706 INFO ]: RCFGBuilder took 297.52 ms. Allocated memory is still 307.8 MB. Free memory was 259.3 MB in the beginning and 250.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 21:29:04,706 INFO ]: BlockEncodingV2 took 15252.92 ms. Allocated memory was 307.8 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 250.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. [2018-06-26 21:29:04,707 INFO ]: TraceAbstraction took 34786.33 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 15.7 MB). Free memory was 1.5 GB in the beginning and 883.3 MB in the end (delta: 623.8 MB). Peak memory consumption was 639.5 MB. Max. memory is 3.6 GB. [2018-06-26 21:29:04,709 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, 176 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.15 ms. Allocated memory is still 307.8 MB. Free memory was 262.2 MB in the beginning and 260.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 43.53 ms. Allocated memory is still 307.8 MB. Free memory was 260.3 MB in the beginning and 259.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 297.52 ms. Allocated memory is still 307.8 MB. Free memory was 259.3 MB in the beginning and 250.3 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15252.92 ms. Allocated memory was 307.8 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 250.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 3.6 GB. * TraceAbstraction took 34786.33 ms. Allocated memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 15.7 MB). Free memory was 1.5 GB in the beginning and 883.3 MB in the end (delta: 623.8 MB). Peak memory consumption was 639.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 3 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (12 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 34.7s OverallTime, 41 OverallIterations, 6 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 38 SDslu, 368 SDs, 0 SdLazy, 11410 SolverSat, 5933 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1779 GetRequests, 1648 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 1666 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2160 NumberOfCodeBlocks, 2136 NumberOfCodeBlocksAsserted, 221 NumberOfCheckSat, 2092 ConstructedInterpolants, 0 QuantifiedInterpolants, 193670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 19672 ConjunctsInSsa, 1385 ConjunctsInUnsatCore, 68 InterpolantComputations, 14 PerfectInterpolantSequences, 25032/32128 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/fig1a.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_21-29-04-725.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fig1a.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_21-29-04-725.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fig1a.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_21-29-04-725.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fig1a.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_21-29-04-725.csv Completed graceful shutdown